Methods, apparatus and articles of manufacture to provide secondary content in association with primary broadcast media content

ABSTRACT

Example methods, apparatus and articles of manufacture to provide media content are disclosed. Example apparatus disclosed herein include means for identifying primary media content presented on a first media presentation device. Disclosed example apparatus also include means for accessing a secondary content schedule associated with the primary media content. The secondary content schedule includes a plurality of secondary content items and time values associated with the secondary content items. The secondary content items are also associated with a loyalty value for a user of the first media presentation device. Disclosed example apparatus further include means for selecting one of the secondary content items to be accessed in response to a timestamp associated with the primary media content being between time values associated with the selected one of the secondary content items in the secondary content schedule.

RELATED APPLICATION

This patent arises from a continuation of U.S. patent application Ser.No. 16/004,111, entitled “METHODS, APPARATUS AND ARTICLES OF MANUFACTURETO PROVIDE SECONDARY CONTENT IN ASSOCIATION WITH PRIMARY BROADCAST MEDIACONTENT,” filed Jun. 8, 2018, which is a continuation of U.S. patentapplication Ser. No. 14/195,547, entitled “METHODS, APPARATUS ANDARTICLES OF MANUFACTURE TO PROVIDE SECONDARY CONTENT IN ASSOCIATION WITHPRIMARY BROADCAST MEDIA CONTENT,” filed Mar. 3, 2014, now U.S. Pat. No.10,003,846, which is a continuation of U.S. patent application Ser. No.12/771,640, entitled “METHODS, APPARATUS AND ARTICLES OF MANUFACTURE TOPROVIDE SECONDARY CONTENT IN ASSOCIATION WITH PRIMARY BROADCAST MEDIACONTENT,” filed Apr. 30, 2010, now U.S. Pat. No. 8,666,528, which claimsthe benefit of U.S. Provisional Patent Application Ser. No. 61/174,787,entitled “Methods and Apparatus To Provide Secondary Content inAssociation with Primary Broadcast Media Content,” and filed on May 1,2009. Priority to U.S. patent application Ser. No. 14/195,547, U.S.patent application Ser. No. 12/771,640 and U.S. Provisional PatentApplication Ser. No. 61/174,787 is claimed. U.S. patent application Ser.No. 14/195,547, U.S. patent application Ser. No. 12/771,640 and U.S.Provisional Patent Application Ser. No. 61/174,787 are herebyincorporated by reference in their respective entireties.

FIELD OF THE DISCLOSURE

This disclosure relates generally to content delivery and, moreparticularly, to methods and apparatus to provide secondary content inassociation with primary broadcast media content.

BACKGROUND

Identifying media content (e.g., television (TV) programs, radioprograms, advertisements, commentary, audio/video content, movies,commercials, advertisements, etc.) is useful for assessing audienceexposure to such content. For example, in audience meteringapplications, a code may be inserted into the audio or video of mediacontent (e.g., a program or advertisement), wherein the code is laterdetected at one or more monitoring sites when the media content ispresented (e.g., played at monitored households). The informationpayload of the code/watermark embedded into an original signal caninclude unique program identification, source identification, and/ortime of broadcast. Monitoring sites may include locations such as,households, stores, places of business and/or any other public and/orprivate facilities, where media content exposure and/or consumption ofmedia content is monitored. For example, at a monitoring site, codesfrom the audio and/or video are captured. The collected codes may thenbe sent to a central data collection facility for analysis.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic illustration of an example primary media contentand secondary content delivery system constructed in accordance with theteachings of this disclosure.

FIG. 2 illustrates an example manner of implementing the example mediaserver of FIG. 1.

FIG. 3 illustrates an example manner of implementing the examplesecondary content presentation device of FIG. 1.

FIGS. 4 and 5 illustrate example user interfaces that may be used topresent secondary content at the example secondary content presentationdevice of FIGS. 1 and 3.

FIGS. 6-10 illustrate example secondary content delivery scenarios thatmay be implemented by the example delivery system of FIG. 1.

FIG. 11 illustrates an example manner of implementing the examplesecondary content server of FIG. 1.

FIG. 12 illustrates an example data structure that may be used toimplement the example action database of FIG. 11.

FIG. 13 illustrates an example data structure that may be used toimplement the example secondary content database of FIG. 11.

FIGS. 14-16 illustrate example secondary content delivery flows that maybe implemented using the example secondary content server of FIGS. 1 and11.

FIG. 17 is a flowchart representative of example machine-accessibleinstructions that may be executed by, for example, a processor, toimplement the example secondary content presentation device of FIGS. 1and 3.

FIG. 18 is a schematic illustration of an example broadcast audiencemeasurement system employing a program identifying code added to theaudio portion of a composite television signal.

FIG. 19 illustrates an example manner of implementing the exampleencoder of FIG. 18.

FIGS. 20A-20C are charts illustrating different example code frequencyconfigurations that may be used by the code frequency selector of FIG.19.

FIG. 21 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to implement the example encoderof FIG. 19.

FIG. 22 illustrates an example manner of implementing the exampledecoder of FIG. 18.

FIG. 23 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to implement the example decoderof FIG. 22.

FIG. 24 is a schematic illustration of an example processor platformthat may be used and/or programmed to carry out the examplemachine-accessible instructions of FIGS. 17, 21, 23, 28, 29, 36, 37, 43,45, 49-52 and 55, the example operations of FIGS. 6-10, 30 and 31, theexample flows of FIGS. 14-16, and/or to implement any or all of theexample methods, apparatus and/or articles of manufacture describedherein.

FIG. 25 illustrates an example manner of implementing the examplesecondary content module of FIGS. 1 and 3.

FIGS. 26 and 27 illustrate example data structures that may be used toimplement a secondary content schedule.

FIGS. 28 and 29 illustrate example machine-accessible instructions thatmay be executed by, for example, a processor, to implement the examplesecondary content module of FIGS. 1, 3 and 25.

FIGS. 30 and 31 illustrate example schedule-based secondary contentdelivery scenarios that may be implemented by the example contentdelivery system of FIG. 1.

FIG. 32 illustrates an example manner of implementing the exampleloyalty-based scheduler of FIG. 11.

FIG. 33 illustrates an example data structure that may be used totabulate programs viewed by different persons.

FIGS. 34 and 35 illustrate an example process to define affinity groups.

FIGS. 36 and 37 illustrate example machine-accessible instructions thatmay be executed by, for example, a processor, to implement the exampleloyalty-based scheduler of FIGS. 11 and 32.

FIG. 38 is a schematic depiction of a broadcast audience measurementsystem employing a program identifying code added to the audio portionof a composite television signal.

FIG. 39 illustrates an example manner of implementing the exampleencoder of FIG. 38.

FIG. 40 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to implement the example decoderof FIG. 39.

FIGS. 40-42 are charts illustrating different example code frequencyconfigurations that may be generated by the machine-accessibleinstructions of FIG. 45 and used in conjunction with the code frequencyselector of FIG. 39.

FIG. 43 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to implement the example encoderof FIGS. 38 and 39.

FIG. 44 illustrates an example system to generate a frequency indextable.

FIG. 45 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to generate a frequency indextable used in conjunction with the code frequency selector of FIG. 39.

FIG. 46 is a chart illustrating critical band indices and how theycorrespond to short and long block sample indices.

FIG. 47 illustrates the frequency relationship between the audioencoding indices.

FIG. 48 illustrates an example manner of implementing the decoder ofFIG. 38.

FIG. 49 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to implement the example decoderof FIGS. 38 and 48.

FIG. 50 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to stack audio in the decoder ofFIG. 48.

FIG. 51 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to determine a symbol encoded inan audio signal in the decoder of FIG. 48.

FIG. 52 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to process a buffer to identifymessages in the decoder of FIG. 48.

FIG. 53 illustrates an example set of circular buffers that may storemessage symbols.

FIG. 54 illustrates an example set of pre-existing code flag circularbuffers that may store message symbols.

FIG. 55 illustrates example machine-accessible instructions that may beexecuted by, for example, a processor, to validate identified messagesin the decoder of FIG. 48.

FIG. 56 illustrates an example filter stack that may store identifiedmessages in the decoder of FIG. 48.

FIG. 57 illustrates an example message payload.

FIG. 58 illustrates an example eXtensible Markup Language (XML) schemathat may be used to construct a secondary content schedule XML document.

DETAILED DESCRIPTION

Example methods, apparatus and articles of manufacture to providesecondary content in association with primary broadcast media contentare disclosed. A disclosed example method includes receiving an audiosignal output by a first media presentation device, the audio signalbeing associated with first media content, decoding the audio signal toextract a code from the audio signal, the code identifying at least oneof the first media content or a broadcaster of the first media content,setting a clock using a timestamp associated with the code, obtainingsecond media content based on the code and the timestamp, the secondmedia content comprising a plurality of pieces of secondary content forrespective ones of a plurality of timestamps, and presenting, at asecond media presentation device, a first of the plurality of pieces ofsecondary media when its respective timestamp substantially correspondsto time value obtained from the clock.

Another example method includes receiving an audio signal output by afirst media presentation device, the audio signal being associated withfirst media content, decoding the audio signal to extract a code fromthe audio signal, the code representative of at least one of the firstmedia content or a broadcaster of the first media content, andtransmitting a wireless signal to a second media presentation device,the signal including the extracted code, the signal to trigger thesecond media presentation device to obtain second media content based onthe code and to present the second media content at the second mediapresentation device.

Still another example methods includes receiving audio output by a firstmedia presentation device, obtaining at least one of a Nielsen code oran Arbitron® code from the audio, the obtained code being representativeof at least one of the first media content or a broadcaster of the firstmedia content, obtaining second media content based on the extractedcode, and presenting the second media content on a second mediapresentation device different from the first media presentation device.

A disclosed example apparatus includes an audio interface to receive anaudio signal output by a first media presentation device, the audiosignal being associated with first media content, a decoder to decodethe audio signal to extract a code from the audio signal, the coderepresentative of at least one of the first media content or abroadcaster of the first media content, the decoder to obtain atimestamp associated with the code, a secondary content module to obtainsecond media content based on the code and the timestamp, the secondmedia content comprising a plurality of pieces of secondary content forrespective ones of a plurality of timestamps, and a user interfacemodule to present a first of the plurality of pieces of secondarycontent media when its respective timestamp substantially corresponds toa time value determined from the timestamp.

Another example apparatus includes an audio interface to receive anaudio signal output by a first media presentation device, the audiosignal being associated with first media content, a decoder to decodethe audio signal to extract a code, the code being associated with atleast one of the first media content or a broadcaster of the first mediacontent, and a wireless interface to transmit a wireless signal to asecond media presentation device, the signal including the extractedcode, the signal to trigger the second media presentation device toobtain second media content based on the code and to present the secondmedia content at the second media presentation device.

Still another example apparatus includes an audio input interface toreceive audio output by a first media presentation device, a decoder toobtain at least one of a Nielsen code or an Arbitron code from theaudio, the obtained code corresponding to at least one of the firstmedia content or a broadcaster of the first media content, a secondarycontent module to obtain second media content based on the extractedcode, and a user interface module to present the second media content ona second media presentation device different from the first mediapresentation device.

The following description makes reference to audio encoding and decodingthat is also known as audio watermarking and watermark detection,respectively. It should be noted that in this context, audio is any typeof signal having a frequency falling within the normal human audibilityspectrum. For example, audio may be speech, music, an audio portion ofan audio and/or video program or work (e.g., a television (TV) program,a movie, an Internet video, a radio program, a commercial spot, etc.),noise, or any other sound.

In general, encoding of audio refers to inserting one or more codes intothe audio. In some examples, the code is psycho-acoustically masked sothat the code is inaudible to human hearers of the audio. However, theremay be certain situations in which the code may be audible to certainhuman listeners. Additionally, these codes may also be referred to aswatermarks. The codes that are embedded in audio may be of any suitablelength, and any suitable technique for mapping information (e.g., achannel identifier, a station identifier, a program identifier, atimestamp, a broadcast identifier, etc.) to the codes may be utilized.Furthermore, the codes may be converted into symbols that arerepresented by signals having selected frequencies that are embedded inthe audio. Any suitable encoding and/or error correcting technique maybe used to convert codes into symbols. A Nielsen code is any codeembedded into any media content by and/or in association with TheNielsen Company (US), LLC or any affiliate of The Nielsen Company (US),LLC.

While the following examples are described with reference to broadcastaudio/video media content (e.g., a TV program, a commercial, a movie,etc.) that include codes embedded and/or encoded into the audio portionthereof, such examples are merely illustrative. For example, codes may,additionally or alternatively, be embedded and/or encoded into othertypes of primary media content such as, but not limited to, videocontent, graphical content, an image, a game, a survey, and/or awebpage. For example, codes can be hidden and/or placed in non-viewableportions of video by, for instance, inserting codes into a verticalblanking interval and/or a horizontal retrace interval. Moreover, themethods and apparatus described herein may be used to detect codesembedded in any number and/or type(s) of additional and/or alternativeprimary media content (e.g., a radio broadcast, an audio announcement,etc.) and to trigger the display of secondary content associated withsuch broadcasted primary media. Further, primary media content need notbe broadcast in order to trigger the presentation of secondary mediacontent. For example, primary media content may be distributed via anynumber and/or type(s) of tangible medium, such as a digital versatiledisc (DVD) and/or a compact disc (CD), that includes embedded codes thatcan trigger the presentation of secondary media content contained on thetangible medium, on a local media store, and/or on a media storeaccessible via, for example, the Internet and/or a local area network(LAN). Further still, non-media content data associated with the primarymedia content may be used to trigger the display of secondary mediacontent associated with the primary media content. For example, data,variables and/or identifiers contained in one or more headers associatedwith a stream of packets transporting the primary media content (e.g.,program and system information protocol (PSIP) information, a transportstream identifier, a program identifier (PID), a station identifier(SID), a timestamp, a CRC, etc.) can be used to trigger the display ofsecondary media content. It should be understood that such headerinformation is carried along side and/or in connection with the datathat represents the primary media content and, thus, occurs in anon-payload portion of a stream transporting the primary media content.

In the examples described herein, before and/or during transmissionand/or broadcasting, the primary media content is encoded to include oneor more codes indicative of the source of the primary media content, thebroadcast time of the primary media content, the distribution channel ofthe primary media content, an identifier for the primary media content,a link (e.g., a URL, an ASCII reference to URL, etc.), particularportions of the primary media content, and/or any other informationdeemed relevant to the operator of the system. When the primary mediacontent is presented on a primary content presentation device (e.g.,played through a TV, a radio, a computing device, a cellular telephone,a hand-held device, and/or any other suitable device), persons in thearea of the presentation are exposed not only to the primary mediacontent, but, unbeknownst to them, are also exposed to the code(s)embedded in the primary media content. As described herein, in additionto the primary media device presenting the broadcasted media content(referred to herein as the “primary media content” or “primary broadcastmedia content”), persons may be provided with and/or utilize a secondarycontent presentation device (e.g., handheld, mobile and/or otherwiseportable devices such as a hand-held computer, a personal digitalassistant (PDA), a cellular telephone, a smartphone, a laptop computer,a netbook computer, an iPod™, a iPad™, and/or any other type(s) ofhand-held, mobile and/or portable user device capable to present mediacontent to a person). Some example secondary content presentationdevices include a microphone and a decoder, and use free-field detectionto detect the code(s) embedded in the primary media content.Additionally or alternatively, secondary content presentation devicescan obtain and/or receive primary content identifiers (e.g., codes,signatures, non-payload information, etc.) via other methods and/orinterfaces, such as a network interface, a Bluetooth interface, etc.Based on the detected code(s), the secondary content presentation deviceretrieves and presents secondary content related to the primary mediacontent identified by the codes. The secondary content may or may not berelated to the primary media content and may itself include mediacontent, user interfaces, advertisements, and/or applications. In someexamples, the secondary content presentation device may be implementedby and/or within the primary presentation device.

Further still, while the examples described herein utilize embeddedaudience measurement codes to identify primary media content, any numberand/or type(s) of additional and/or alternative methods may be used toidentify primary media content. For example, one or more signaturesand/or fingerprints may be computed from and/or based on the primarymedia content and compared with a database of signatures to identify theprimary media content. An example signature is computed via datacompression applied to an audio portion of the primary media content.Example methods, apparatus and articles of manufacture to computesignatures and/or to identify media using signatures are described inU.S. patent application Ser. No. 12/110,951, entitled “Methods andApparatus For Generating Signatures” and filed Apr. 28, 2008, and U.S.patent application Ser. No. 12/034,489, entitled “Methods and ApparatusFor Characterizing Media” and filed Feb. 20, 2008. Each of U.S. patentapplication Ser. No. 12/110,951 and U.S. patent application Ser. No.12/034,489 is hereby incorporated by reference in its entirety.

FIG. 1 illustrates an example primary media content and secondarycontent delivery system 100. To allow a person to play, view and/orrecord primary media content, the example system 100 of FIG. 1 includesany number and/or type(s) of media servers (one of which is designatedat reference numeral 105), and any number and/or type(s) of primarymedia content presentation devices (one of which is designated atreference numeral 110). The example media servers 105 of FIG. 1 arecustomer-premises devices, consumer devices, and/or user devices and maybe located, implemented and/or operated in, for example, a house, anapartment, a place of business, a school, a government office, a medicalfacility, a church, etc. Example media servers 105 include, but are notlimited to, a set top box (STB), a digital video recorder (DVR), a videocassette recorder (VCR), a DVD player, a CD player, a personal computer(PC), a game console, a radio, an advertising device, an announcementsystem, and/or any other type(s) of a media player. Example primarymedia content presentation devices 110 include, but are not limited to,a speaker, an audio system, a TV and/or a monitor. In some examples, theexample media server 105 of FIG. 1 outputs audio and/or video signalsvia the primary content presentation device 110. For instance, a DVDplayer 105 may display a movie via a screen and a speaker (not shown) ofa TV 110 and/or a speaker of an audio system 110. Example primary mediacontent includes, but is not limited to, TV programs, movies, videos,commercials, advertisements, audio, video, games, web pages,advertisements and/or surveys.

In the example delivery system 100 of FIG. 1, the example media server105 receives primary media content via any number and/or type(s) ofsources such as, for example: a satellite receiver and/or antenna 115; aradio frequency (RF) input signal 120 received via any number and/ortype(s) of cable TV signal(s) and/or terrestrial broadcast(s); aterrestrial and/or satellite radio broadcast; any number and/or type(s)of data communication network(s) such as the Internet 125; any numberand/or type(s) of local or remote data and/or media store(s) 130 suchas, for example, a hard disk drive (HDD), a VCR cassette, a DVD, a CD, aflash memory device, etc. In the example delivery system 100 of FIG. 1,at least some of the primary media content (regardless of its sourceand/or type) includes embedded audience measurement codes and/orwatermarks that were purposefully inserted by a content provider,audience measurement entity and/or broadcaster 135 to facilitateaudience measurement and/or audience rating determinations for theprimary media content. Example methods and apparatus to insert and/orembed audience measurement codes such as Nielsen codes in primarycontent are described below in connection with FIGS. 18-21 and 38-47.Other example methods and apparatus to insert and/or embed audiencemeasurement codes in primary content are described in U.S. patentapplication Ser. No. 12/604,176, entitled “Methods and Apparatus toExtract Data Encoded in Media Content,” and filed Oct. 22, 2009, whichis hereby incorporated by reference in its entirety. A preferred exampleof such audience measurement codes include the Nielsen Audio EncodingSystem (NAES) codes (a.k.a. Nielsen codes) that are proprietary to TheNielsen Company (US), LLC, the assignee of the present patent. ExampleNAES codes include the NAES II and NAES V audio code systems. However,any past, present and/or future NAES codes may be used. Other exampleaudience measurement codes include, but are not limited to, thoseassociated with the Arbitron audio encoding system.

To provide and/or broadcast primary media content, the example deliverysystem 100 of FIG. 1 includes any number and/or type(s) of contentprovider(s) and/or broadcaster(s) 135 such as, for example, RF TVstations, Internet protocol TV (IPTV) broadcasters, digital TV (DTV)broadcasters, cable TV broadcasters, satellite TV broadcasters, moviestudios, terrestrial radio broadcasters, satellite radio broadcasters,etc. In the illustrated example of FIG. 1, the content provider(s)and/or broadcaster(s) 135 deliver and/or otherwise provide the primarymedia content to the example media server 105 via any desired medium(e.g., a satellite broadcast using a satellite transmitter 140 and asatellite and/or satellite relay 145, a terrestrial broadcast, a cableTV broadcast, the Internet 125, and/or the media store(s) 130).

To provide secondary content, which may or may not be related to primarymedia content being presented at and/or via the media server 105 and/orthe primary content presentation device 110, the example primary mediacontent and secondary content delivery system 100 of FIG. 1 includes anynumber and/or type(s) of secondary content presentation devices, one ofwhich is designated with reference numeral 150. The example secondarycontent presentation devices 150 of FIG. 1 are customer-premisesdevices, consumer devices, and/or user devices. Example secondarycontent presentation devices 150 include, but are not limited to, ahand-held computer, a PDA, a cellular telephone, a smartphone, a laptopcomputer, a netbook computer, and/or any other type(s) of hand-held,mobile and/or portable secondary content presentation device capable topresent primary media content and/or secondary content to a person. Inthe illustrated example of FIG. 1, the secondary content presentationdevice 150 can communicate with other devices of a LAN 155 (e.g., themedia server 105) via any number and/or type(s) of wireless router(s)and/or wireless access point(s), one of which is designated at referencenumeral 160. The example secondary content presentation device 150 cancommunicate with the Internet 125 via the example LAN 155 and/or via acellular base station 165. Moreover, while not depicted in FIG. 1, thesecondary content presentation device 150 can be communicatively coupledto the LAN 155 via a wired communication protocol and/or communicationsignal.

To provide secondary content identified via primary broadcast mediacontent, the example secondary content presentation device 150 of FIG. 1includes a secondary content module 170. The example secondary contentmodule 170 of FIG. 1 detects the presence of codes and/or watermarks infree-field radiating audio signals 172 and 173 emitted by, for example,one or more speaker(s) of the media server 105 and/or the primarycontent presentation device 110. When a code is detected, the examplesecondary content module 170 obtains secondary content associated withthe detected code and/or watermark from a secondary content server 175and/or the media server 105 via the wireless router 160 and/or the basestation 165, and presents the thus obtained secondary content on adisplay 330 (FIG. 3) of the secondary content presentation device 150.Example manners of implementing the example secondary content module 170and/or, more generally, the example secondary content presentationdevice 150 are described below in connection with FIGS. 3, 17 and 25.Example methods and apparatus to detect and decode codes and/orwatermarks embedded in the audio signals 172 and 173 are described belowin connection with FIGS. 18, 22, 23, 38, and 48-56. Other examplemethods and apparatus to detect and decode codes and/or watermarksembedded in the audio signals 172 and 173 are described in U.S. patentapplication Ser. No. 12/604,176, entitled “Methods and Apparatus toExtract Data Encoded in Media Content,” and filed Oct. 22, 2009.

As described below in connection with FIG. 2, in some examples, themedia server 105 includes a secondary content triggerer 180 that detectsand decodes codes and/or watermarks embedded in primary media contentand/or in non-payload portions of primary media content (e.g., a headerof a data stream transporting the primary media content), and triggersthe secondary content presentation device 150 to retrieve and/or presentsecondary content via, for example, a Bluetooth signal and/or a wirelessLAN signal. Such triggers include and/or identify the code(s) detectedand/or decoded by the secondary content triggerer 180. In some examples,the detecting and/or decoding of codes at the media server 105 occurssimultaneous to the presentation of the primary media content via theprimary content presentation device 110. When the secondary contentpresentation device 150 is triggered by the secondary content triggerer180, the secondary content presentation device 150 retrieves andpresents secondary content associated with the detected code, asdescribed above. Alternatively, the triggering include a push of thesecondary content from the media server 105 to the secondary contentpresentation device 150 so that the secondary content presentationdevice 150 need not request the secondary media content. The methods andapparatus described below in connection with FIGS. 18, 22, 23, 38, and48-56, and/or U.S. patent application Ser. No. 12/604,176 may be used toimplement the example secondary content triggerer 180. An example mannerof implementing the example media server 105 of FIG. 1 is describedbelow in connection with FIG. 2.

Additionally or alternatively, the example media server 105 of FIG. 1may implement a secondary content serving module 185 that allows theexample secondary content module 170 to obtain secondary content fromthe media server 105 and/or from the secondary content server 175. Thus,the secondary content module 170 and/or, more generally, the examplesecondary content presentation device 150 can present locally cachedand/or available secondary content as well as secondary contentavailable via the Internet 125.

The example secondary content server 175 of FIG. 1 responds to queriesfor secondary content. For example, when the secondary contentpresentation device 150 of FIG. 1 provides a code and/or watermarkdecoded from primary media content, the secondary content server 175provides one or more links (e.g., a URL) to secondary content, providesone or more pieces of secondary content (e.g., a webpage, a banner, animage, a video clip, etc.), and/or provides tuning information (e.g., toa mobile DTV signal, channel and/or broadcast, and/or an IPTV signal,channel, and/or multicast) that may be used to obtain the secondarymedia content to the secondary content presentation device 150. Thesecondary content presentation device 150 preferably automaticallyactivates the URLs and/or the tuning information to automatically obtainand start displaying the secondary media content. As discussed below, afilter may be utilized to determine whether given URL and/or tuninginformation is automatically activated. In some examples, the secondarycontent server 175 and/or the ratings server 190 identify the primarymedia content and/or portion(s) of the primary media content associatedwith the code and/or watermark. This identification is useful foraudience measurement purposes. An example manner of implementing theexample secondary content server 175 of FIG. 1 is described below inconnection with FIGS. 11 and 32.

To determine audience rating information, the example delivery system ofFIG. 1 includes the example ratings server 190. Using, among otherthings, embedded codes, computed signatures and/or non-payload dataand/or information detected, decoded, extracted and/or computed by thesecondary content presentation device 150, the media server 105, anaudience measurement device associated with the media server 105 (notshown), an audience measurement device associated with the primarycontent presentation device 110 (not shown), and/or similar devices atother locations, the example rating server 190 of FIG. 1 developsmeaningful content exposure statistics. For instance, the exampleratings server 190 can determine the overall effectiveness, reach and/oraudience demographics of primary media content and/or secondary contentby processing the collected data (e.g., codes, URLs, personidentification information, etc.) using any number and/or type(s) ofstatistical method(s). These ratings may relate to the primary content,the secondary content or both the primary and secondary content. In someexamples, the media server 105 and/or the secondary content presentationdevice 150 store a log of audience measurement data and periodically(e.g., once a day) and/or aperiodically send the collected data to theratings server 190 for processing. Additionally or alternatively, aseach code, signatures and/or non-payload information is detected,extracted, computed and/or decoded it may be provided to the ratingsserver 190. Access to secondary content by, for example, activating aURL is also preferably logged and provided to the rating server 190.

FIG. 2 illustrates an example manner of implementing the example mediaserver 105 of FIG. 2. To receive primary broadcast media content and/orsecondary content from the content provider(s) 135, the example mediaserver 105 of FIG. 2 includes any number and/or type(s) of broadcastinput interfaces, one of which is designated at reference numeral 205.The example broadcast input interface 205 of FIG. 2 receives broadcastprimary media content via any number and/or type(s) of device(s),module(s), circuit(s) and/or interface(s) (e.g., a RF tuner configurableto receive a selected terrestrially broadcast TV signal).

To decode primary media signals, the example media server 105 of FIG. 2includes a media decoder 210. When a media signal received via thebroadcast input interface 205 is encoded and/or encrypted, the examplemedia decoder 210 decodes and/or decrypts the primary media signal into,for example, a form suitable for output to the example primary contentpresentation device 110 via a presentation device interface 215. Examplepresentation device interfaces 215 include, but are not limited to, anRF output module, a component video output module, and/or ahigh-definition multimedia interface (HDMI) module.

To store received media content, the example media server 105 of FIG. 2includes the example media store(s) 130. Additionally or alternatively,the media server 105 may be communicatively coupled to removable mediastores, such as a DVD reader or a CD reader, and/or be communicativelycoupled to an external storage device. An example media store 130 is aHDD.

To trigger the example secondary content presentation device 150 toretrieve and present secondary content related to primary media content,the example media server 105 of FIG. 2 includes the example secondarycontent triggerer 180. When the example secondary content triggerer 180of FIG. 2 detects a code embedded in primary media content and/or anidentifier contained in a non-payload portion of the primary mediacontent (e.g., a PID, a SID and/or a timestamp contained in one or morepacket headers), which may be currently being presented, the secondarycontent triggerer 180 notifies the secondary content presentation device150 via, for example, any type of short-range wireless interface, suchas a Bluetooth interface 220, and/or any type of wireless LAN interface225. Some examples exclude the secondary content triggerer 180 andinstead rely on the secondary content presentation device 150 to detectinaudible codes and utilize the same to retrieve secondary content. Thetrigger sent by the secondary content triggerer 180 to the secondarycontent presentation device 150 may include the code detected in theprimary media content, a signature and/or fingerprint computed based onthe primary media content, and/or an identifier contained in anon-payload portion of the primary media content (e.g., a PID, a SIDand/or a timestamp contained in one or more packet headers).

To provide secondary content, the example media server 105 of FIG. 2includes the example secondary content serving module 185. When arequest for secondary content is received from the example secondarycontent presentation device 150 via the wireless interface 225 and/orany type of wired communication interface 230, the secondary contentserving module 185 of FIG. 2 queries the example media store(s) 130 forsecondary content associated with a detected code, and returns thesecondary content to the secondary content presentation device 150. Therequest for the secondary content is preferably triggered by thedetection of the inaudible code as explained above. The secondarycontent may or may not be related to the primary media content. Thesecondary content may be received by the media server 105 via thebroadcast input interface 205 and be stored and/or cached in the mediastore(s) 130. In some examples, the secondary content may be received atthe media server 105 in conjunction with the primary media content(e.g., on a minor channel of a DTV broadcast). Additionally oralternatively, the secondary content may be received via one or moreseparate program stream(s) using the same or a different communicationmedium as the primary content stream, and/or may be pushed to the mediaserver 105 by the secondary content server 175. Some examples excludethe secondary content serving module 185 and instead rely on thesecondary content presentation device 150 to detect inaudible codes andutilize the same to retrieve secondary content from the secondarycontent server 175.

While an example manner of implementing the example media server 105 ofFIG. 1 has been illustrated in FIG. 2, one or more of the interfaces,data structures, elements, processes and/or devices illustrated in FIG.2 may be combined, divided, re-arranged, omitted, eliminated and/orimplemented in any other way. Further, the broadcast input interface205, the example media decoder 210, the example presentation deviceinterface 215, the example Bluetooth interface 220, the example wirelessinterface 225, the example communication interface 230, the examplemedia store(s) 130, the example secondary content triggerer 180, theexample secondary content serving module 185 and/or, more generally, theexample media server 105 of FIG. 2 may be implemented by hardware,software, firmware and/or any combination of hardware, software and/orfirmware. Thus, for example, any of the broadcast input interface 205,the example media decoder 210, the example presentation device interface215, the example Bluetooth interface 220, the example wireless interface225, the example communication interface 230, the example media store(s)130, the example secondary content triggerer 180, the example secondarycontent serving module 185 and/or, more generally, the example mediaserver 105 may be implemented by one or more circuit(s), programmableprocessor(s), application-specific integrated circuit(s) (ASIC(s)),programmable logic device(s) (PLD(s)), field-programmable logicdevice(s) (FPLD(s)), and/or field-programmable gate array(s) (FPGA(s)),etc. When any apparatus claim of this patent incorporating one or moreof these elements is read to cover a purely software and/or firmwareimplementation, at least one of the broadcast input interface 205, theexample media decoder 210, the example presentation device interface215, the example Bluetooth interface 220, the example wireless interface225, the example communication interface 230, the example media store(s)130, the example secondary content triggerer 180, the example secondarycontent serving module 185 and/or, more generally, the example mediaserver 105 are hereby expressly defined to include a tangible article ofmanufacture such as a tangible computer-readable medium such as thosedescribed below in connection with FIG. 17 storing the firmware and/orsoftware. Further still, the example media server 105 may includeinterfaces, data structures, elements, processes and/or devices insteadof, or in addition to, those illustrated in FIG. 2 and/or may includemore than one of any or all of the illustrated interfaces, datastructures, elements, processes and/or devices.

FIG. 3 illustrates an example manner of implementing the examplesecondary content presentation device 150 of FIG. 1. To receive thefree-field radiating audio signals 172 and 173 of FIG. 1, the examplesecondary content presentation device 150 of FIG. 3 includes any type ofaudio input interface 305, such as a microphone. To detect and/or decodecodes and/or watermarks present in the audio signals 172 and 173, theexample secondary content presentation device 150 of FIG. 3 includes adecoder 310. Example apparatus and methods that may be used to implementthe example decoder 310 of FIG. 3 are described below in connection withFIGS. 18, 22, 23, 38, and 48-56. In some examples, to conserve batterylife, the decoder 310 does not operate continuously. Instead, thedecoder 310 may be aperiodically and/or periodically activated todetermine whether the primary media content has changed. During timeintervals when the decoder 310 is turned off and/or in a stand-by mode,and/or to compensate for or accommodate delays in transferring orreceiving secondary content, the secondary content module 170 cancontinue presenting secondary content according to a secondary-contentschedule, such as those described below in connection with FIGS. 26 and27. In some examples, the secondary-content schedule is used to deliversecondary content to the secondary content presentation device 150 priorto when the secondary content is to be presented to accommodate contentdelivery delays and/or interruption(s) of network connectivity. That is,secondary content may be delivered in non real-time (e.g., early) eventhough the secondary content is presented substantially in real-time ata specified location in the primary media content.

It should be apparent that turning off the decoder 310 might affect howpromptly the secondary content presentation device 150 can detect achange in primary media content. To reduce such effects, the decoder 310could continuously operate to detect SIDs thereby remaining responsiveto, for example, channels changes while less frequently detecting,decoding and/or validating timestamps. How often timestamps aredetected, decoded and/or validated may be adjusted depending on the timeduration encompassed by a particular secondary content schedule, and/orto achieve a desired level of time synchronization between primary andsecondary media content. For example, timestamps may be continuouslydetected in order to accommodate the skipping of commercials and/orother portions of the primary media content when the primary mediacontent was, for example, pre-recorded.

To retrieve and present secondary content, the example secondary contentpresentation device 150 of FIG. 3 includes the example secondary contentmodule 170. When the example decoder 310 detects an embedded code and/orwatermark, the example secondary content module 170 of FIG. 3 queriesthe secondary content server 175 and/or the example media server 105 viaany type of wireless LAN interface 315 and/or any type of cellularinterface 320. In response to the query, the example secondary contentmodule 170 receives one or more pieces of secondary content and/or oneor more links (e.g., URLs) to secondary content. An example manner ofimplementing the example secondary content module 170 is described belowin connection with FIG. 25.

To present, among other things, secondary content, the example secondarycontent presentation device 150 of FIG. 3 includes any type of userinterface module 325, and any type of display 330. The example secondarycontent module 170 of FIG. 3 generates and provides to the userinterface module 325 one or more user interfaces that represent, depictand/or allow a user to view, select and/or activate secondary content.Example user interfaces that may be used to represent, depict, presentand/or allow a user to select secondary content are described below inconnection with FIGS. 4 and 5. The example user interfaces generated bythe example secondary content module 170 may be responsive to userinputs and/or selections received via any number and/or type(s) of inputdevice(s) 335.

In some examples, the user interface module 325 of FIG. 3 is implementedin conjunction with an operating system (OS) executing on a processor(not shown) of the secondary content presentation device 150. In such anexample, the secondary content module 170 may be implemented as asoftware application executing within the OS that accesses anapplication programming interface (API) implemented by the OS to cause auser interface to be displayed on the display 330 and to receive userinputs via the input device(s) 335. Example machine-accessibleinstructions that may be executed to implement the example secondarycontent module 170 of FIG. 3 are described below in connection with FIG.17.

To store, among other things, primary and/or secondary media contentreceived by and/or obtained by the secondary content module 170, theexample secondary content presentation device 150 of FIG. 3 includes anynumber and/or type(s) of media stores, one of which is designated atreference numeral 340. In some examples, secondary content may beobtained, cached, and/or pushed to the secondary content presentationdevice 150, and stored on the media store 340, prior to presentationand/or after presentation via the user interface module 325 and thedisplay 330.

In some examples, the example secondary content module 170 of FIG. 3 maybe triggered to obtain, receive and/or present secondary content and/orlinks to secondary content via any type of short-range wirelessinterface, such as a Bluetooth interface 345, and/or via the examplewireless LAN interface 315. The trigger received via the Bluetoothinterface 345 and/or the wireless LAN interface 315 includes theembedded code and/or non-payload code (e.g., a PID, a SID and/or atimestamp extracted from one or more packet headers) detected at themedia server 105.

While an example manner of implementing the example secondary contentpresentation device 150 of FIG. 1 has been illustrated in FIG. 3, one ormore of the interfaces, data structures, elements, processes and/ordevices illustrated in FIG. 3 may be combined, divided, re-arranged,omitted, eliminated and/or implemented in any other way. Further, theexample audio input interface 305, the example decoder 310, the examplewireless interface 315, the example cellular interface 320, the exampleuser interface module 325, the example display 330, the example inputdevice(s) 335, the example media store 340, the example Bluetoothinterface 345, the example secondary content module 170 and/or, moregenerally, the example secondary content presentation device 150 of FIG.3 may be implemented by hardware, software, firmware and/or anycombination of hardware, software and/or firmware. Thus, for example,any of the example audio input interface 305, the example decoder 310,the example wireless interface 315, the example cellular interface 320,the example user interface module 325, the example display 330, theexample input device(s) 335, the example media store 340, the exampleBluetooth interface 345, the example secondary content module 170and/or, more generally, the example secondary content presentationdevice 150 may be implemented by one or more circuit(s), programmableprocessor(s), ASIC(s), PLD(s), FPLD(s), and/or FPGA(s), etc. When anyapparatus claim of this patent incorporating one or more of theseelements is read to cover a purely software and/or firmwareimplementation, at least one of the example audio input interface 305,the example decoder 310, the example wireless interface 315, the examplecellular interface 320, the example user interface module 325, theexample display 330, the example input device(s) 335, the example mediastore 340, the example Bluetooth interface 345, the example secondarycontent module 170 and/or, more generally, the example secondary contentpresentation device 150 are hereby expressly defined to include atangible article of manufacture such as a tangible computer-readablemedium such as those described below in connection with FIG. 17 storingthe firmware and/or software. Further still, the example secondarycontent presentation device 150 may include interfaces, data structures,elements, processes and/or devices instead of, or in addition to, thoseillustrated in FIG. 3 and/or may include more than one of any or all ofthe illustrated interfaces, data structures, elements, processes and/ordevices.

FIGS. 4 and 5 illustrate example user interfaces that may be presentedvia the example display 330 of FIG. 3 to present secondary content to auser. Each of the example user interfaces of FIGS. 4 and 5 include anupper banner portion 405 that includes a broadcast source identifier 410and the current time 415. An example broadcast source identifier 410 isa logo associated with a broadcaster and/or content provider 135.

Each of the example user interfaces of FIGS. 4 and 5 also include amiddle tool bar portion 420 that includes one or more buttons and/oractivatable user interface elements, one of which is designated atreference numeral 425. Example buttons 425 allow a user to controlsettings associated with the example secondary content module 170,access and/or utilize social networking features implemented by thesecondary content module 170, save secondary content for subsequentretrieval, get information related to persons appearing in a primarymedia content, etc.

The example user interface of FIG. 4 includes a lower portion 430 thatdisplays one or more user selectable and/or activatable elements (e.g.,icons, bitmap images, text, links, etc.), one of which is designated atreference numeral 435. When a particular link 435 is activated and/orselected by a user, the lower portion of the example user interface ofFIG. 4 is replaced with the secondary content 505 associated with thatelement 435, as shown in FIG. 5. For example, the secondary content 505may display a webpage associated with and/or facilitating purchase of aparticular product advertised in a commercial portion of primary mediacontent currently being presented at the primary content presentationdevice 110. As shown in FIG. 5, a button 510 is provided to stop displayof the secondary content 505 and return to the list of selected elements435 shown in FIG. 4. When more secondary content elements are to bedisplayed than fit within the display area of the lower portion 430, theexample user interface of FIG. 4 may include navigation elements 440 toallow a user to navigate through the selectable elements 435.

While user interfaces are illustrated in FIGS. 4 and 5, any numberand/or type(s) of additional and/or alternative user interfaces may beused to present secondary content. For example, one or more of thedepicted elements may be combined, divided, re-arranged, omitted,eliminated and/or implemented in any other way. Moreover, the exampleuser interfaces may include elements instead of, or in addition to,those illustrated in FIGS. 4 and/or 5, and/or may include more than oneof any or all of the illustrated elements.

FIGS. 6, 7, 8, 9 and 10 illustrates example secondary content deliveryscenarios that may be carried out by the example delivery system 100 ofFIG. 1. While the examples illustrated in FIGS. 6-10 are depicted in aserial fashion, as discussed below in connection with FIG. 17, theactivities of the activities of detecting codes, detecting timestampst(n), obtaining secondary content, obtaining links to secondary content,obtaining secondary content schedules, displaying secondary contentlinks, displaying secondary content offers can occur substantially inparallel. Moreover, secondary content may be presented without providingand/or presenting an intervening link and/or offer to that content. Asdescribed below in connection with FIGS. 25-31, secondary content may,additionally or alternatively, be provided and/or displayed based on aschedule of secondary content. A schedule of secondary content definesat what times within primary media content secondary media content is tobe presented. The secondary content schedule may be used to obviate theneed for repeated, ongoing and/or continual interactions that canconsume network bandwidth, can cause a lack of synchronization betweenthe secondary content server 175 and/or the secondary contentpresentation device 150, and/or may make the example system 100 of FIG.1 more sensitive to bandwidth constraints and/or transmission latencies.Thus, while the example scenarios of FIGS. 6-10 are described withreference to particular secondary media content items, the examplescenarios of FIGS. 6-10 could, additionally or alternatively, used toprovide a schedule of secondary content.

The example secondary content delivery scenario of FIG. 6 begins withthe example media server 105 receiving primary media content 605 via theexample broadcast input interface 205. The example media server 105and/or the example primary content presentation device 110 emits and/oroutputs the free-field radiating audio signal 172, 173 associated withthe primary media content 605 via, for example, one or more speakers.

When the example decoder 310 of the secondary content presentationdevice 105 detects a code 615 in the audio 172, 173 (block 610), thesecondary content module 170 provides the code 615 to the exampleratings server 190 to facilitate audience measurement. The examplesecondary content module 170 also queries the content server 175 basedon the code 615 to receive one or more links 620 to secondary content.The user interface module 325 and the example secondary content module170 display the obtained links 620 using, for example, the example userinterface of FIG. 4. When one of the links 620 is selected and/oractivated by a user (block 625), the secondary content module 170 sendsan identifier 630 associated with the link to the ratings server 190,also obtains the secondary content associated with the selected and/oractivated link from the content server 175 (lines 635 and 640), anddisplays the obtained secondary content 640 using, for example, the userinterface of FIG. 5 (block 645). If the collection of audiencemeasurement data is not desired, the interaction with the ratings server190 may be omitted in the illustrated example of FIG. 6.

Turning to FIG. 7, the first portion of the example scenario of FIG. 7is identical to the first portion of the example scenario of FIG. 6.Accordingly, identical references numerals have been used in the firstportions of FIGS. 6 and 7, and the interested reader is referred to thediscussion presented above in connection with FIG. 6 for descriptions ofthe identically numbered elements.

In the illustrated example of FIG. 7, links 620 to secondary content areretrieved from the secondary content server 175; however, the secondarycontent 710 is retrieved and/or obtained from the media server 105rather than from the content server 175. Thus, when a particular link620 is selected and/or activated (block 625), the secondary contentmodule 170 sends a request 705 for the secondary content 710 associatedwith the selected link 620 to the media server 105, and receives thesecondary content 710 from the media server 105. The secondary contentmodule 170 then displays the secondary content 710 obtained from themedia server 105 using, for example, the user interface of FIG. 5 (block715). If the collection of audience measurement data is not desired, theinteraction with the ratings server 190 may be omitted in theillustrated example of FIG. 7.

In the illustrated example of FIG. 8, the secondary content presentationdevice 150 obtains secondary content and links to secondary content fromthe media server 105 rather than from the secondary content server 175.Thus, in the illustrated example of FIG. 8 the secondary contentpresentation device 150 need not interact with the secondary contentserver 175. The example secondary content delivery scenario of FIG. 8begins with the example media server 105 receiving primary media content805 via the example broadcast input interface 205. The example mediaserver 105 and/or the example primary content presentation device 110emits and/or outputs the free-field radiating audio signal 172, 173associated with the primary media content 805 via, for example, one ormore speakers.

When the example secondary content serving module 185 receives secondarycontent 820, the secondary content serving module 185 stores and/orcaches the secondary content 820 in the media store(s) 130 (block 825).

When the example decoder 310 of the secondary content presentationdevice 105 detects a code 815 in the audio 172, 173 (block 810), thesecondary content module 170 provides the code 815 to the exampleratings server 190 to facilitate audience measurement. The examplesecondary content module 170 queries the secondary content servingmodule 185 based on the code 815, and receives one or more links 835 tosecondary content. The user interface module 325 and the examplesecondary content module 170 display the obtained links 835 using, forexample, the example user interface of FIG. 4. When one of the links 835is selected and/or activated (block 840), the secondary content module170 sends an identifier 845 associated with the selected link 835 to theratings server 190, obtains the content 855 associated with the selectedand/or activated link 835 from the content server 175 (lines 850 and855), and displays the obtained content 855 using, for example, the userinterface of FIG. 5 (block 860). If the collection of audiencemeasurement data is not desired, the interaction with the ratings server190 may be omitted in the illustrated example of FIG. 8.

In the illustrated example of FIG. 9, the media server 105 detects codesin primary media content and triggers the presentation of secondarycontent at the secondary content presentation device 150. The examplesecondary content delivery scenario of FIG. 9 begins with the examplemedia server 105 receiving primary media content 905 via the examplebroadcast input interface 205. When the example secondary contentserving module 185 receives secondary content 910, the secondary contentserving module 185 stores and/or caches the secondary content 910 in themedia store(s) 130 (block 915).

When the secondary content triggerer 180 detects a code 925 in theprimary media content 905 (block 920), the secondary content servingmodule 185 sends the code 925 to the ratings server 192, and thesecondary content triggerer 180 sends a trigger 930 to the secondarycontent presentation device 150 via the Bluetooth interface 220 and/orthe wireless interface 225. The secondary content serving module 185also sends links 935 associated with the detected code 925 to thesecondary content presentation device 150. In alternative examples,rather than sending links and/or the trigger 930, the secondary contentserving module 185 pushes the secondary content to the secondary contentpresentation device 150. The trigger 930 sent by the secondary contenttriggerer 180 to the secondary content presentation device 150 may,additionally or alternatively, include the code detected in the primarymedia content 905, a signature and/or fingerprint computed based on theprimary media content 905, and/or an identifier contained in anon-payload portion of the primary media content 905 (e.g., a PID, a SIDand/or a timestamp contained in one or more packet headers).

The user interface module 325 and the example secondary content module170 display the provided links 935 (or the secondary content) using, forexample, the example user interface of FIG. 4. When one of the links 935is selected and/or activated (block 940), the secondary content module170 obtains the secondary content 950 associated with the selectedand/or activated link 935 from the content server 175 (lines 945 and950), and displays the obtained secondary content 950 using, forexample, the user interface of FIG. 5 (block 960). In response to therequest 945, the secondary content serving module 185 sends a contentidentifier 955 associated with the selected and/or activated link 935 tothe ratings server 190. If the collection of audience measurement datais not desired, the interaction with the ratings server 190 may beomitted in the illustrated example of FIG. 9.

In the illustrated example of FIG. 10, content server 175 caches and/orpre-stores secondary content on the secondary content presentationdevice 150 for identified primary media content. The example secondarycontent delivery scenario of FIG. 10 begins with the example mediaserver 105 receiving primary media content 1005 via the examplebroadcast input interface 205. The example media server 105 and/or theexample primary content presentation device 110 emits and/or outputs thefree-field radiating audio signal 172, 173 associated with the primarymedia content 1005 via, for example, one or more speakers.

When the example decoder 310 of the secondary content presentationdevice 105 detects a code 1015 in the audio 172, 173 (block 1010), thesecondary content module 170 provides the code 1015 to the exampleratings server 190 to facilitate audience measurement. The examplesecondary content module 170 queries the content server 175 based on thecode 1015 and receives secondary content 1025 for the primary mediacontent 1005. The secondary content 1025 is stored and/or cached in theexample media store 340 (block 1030).

The user interface module 325 and the example secondary content module170 displays the secondary content 1025 using, for example, the exampleuser interface of FIG. 5, and/or displays links 435 associated with thesecondary content 1025 using, for example, the example user interface ofFIG. 4 (block 1040). In some examples, the secondary content 1025 whendisplayed may contain one or more selectable and/or activatable links.When a particular link is selected (block 1045), the secondary contentmodule 170 sends an identifier 1050 for the selected and/or activatedlink to the ratings server 190, and checks whether the secondary contentassociated with the identifier 1050 is cached (block 1055). If thesecondary content associated with the selected link is cached in themedia store 340 (block 1055), the secondary content module 170 retrievesthe secondary content 1025 associated with the selected link from themedia store 340 and displays the retrieved secondary content using, forexample, the user interface of FIG. 5 (block 1040). If the secondarycontent associated with the selected link is not available in the mediastore 340 (block 1055), the secondary content module 170 queries thecontent server 175 based on an identifier 1060 associated with theselected link and receives the secondary content 1065 associated withthe selected link from the secondary content server 175.

In alternative examples, rather than retrieving links and/or secondarycontent in response to the code 1015, the secondary content server 175may push the secondary content to the secondary content presentationdevice 150 independent of any code detection at the secondarypresentation device 150. In such alternatives, the secondary contentmodule 170 can query the media store 340 for the secondary content 1025associated with the detected code 1015 before querying the secondarycontent server 175 for the secondary content 1025. If the collection ofaudience measurement data is not desired, the interaction with theratings server 190 may be omitted in the illustrated example of FIG. 9.

FIG. 11 illustrates an example manner of implementing the examplesecondary content server 175 of FIG. 1. To allow a person 1105 to definesecondary content and/or to associate secondary content with primarymedia content and/or portions of primary media content. The examplesecondary content server 175 of FIG. 11 includes a client interface1110. The example client interface 1110 of FIG. 11 is a web-basedinterface and/or a customized API that allows the person 1105 tointeract with an action register 1115 to define “actions,” (e.g.,particular pieces of secondary content) and to store such definedactions in an action database 1120. An example data structure that maybe used to implement the example action database 1120 is described belowin connection with FIG. 12.

The example client interface 1110 of FIG. 11 also allows the person 1105to interact with an action scheduler 1125 to associate defined actionsstored in the action database 1120 with particular primary media contentand/or portions of primary media content identified in a programdatabase 1130. Associations of actions to primary media content and/orprimary media content portions are stored in a content database 1135. Insome examples, the price(s) of associating an action with particularprimary media content and/or portion(s) thereof depends on time of day,day of week, number of times action is to be associated, etc. An exampledata structure that may be used to implement the example contentdatabase 1135 is described below in connection with FIG. 13.

In some examples, the action scheduler 1125 of FIG. 11 builds and/orcompiles a schedule of secondary content to be provided in response toidentified primary media content. Such a secondary content scheduledefines one or more secondary content items to be presented at and/orduring particular times of the identified primary media content. Exampledata structures that may be used to represent a secondary contentschedule are described below in connection with FIGS. 26 and 27.

To allow the example media server 105 and/or the secondary contentpresentation device 150 to query for and/or obtain secondary content,the example secondary content server 175 of FIG. 11 includes an actionserver 1140. When a code and an optional timestamp is received from themedia server 105 or from the secondary content presentation device 150,the example action server 1140 identifies the primary media contentand/or portion of primary media content associated with the receivedcode. Based on the identified primary media content and/or portionthereof, the action server 1140 queries the content database 1135 toidentify the action(s) (e.g., secondary content) and/or a schedule ofsecondary content associated with the code and the optional timestamp.The action server 1140 returns the identified action(s) and/or theidentified secondary content schedule to the requesting media server 105or secondary content presentation device 150. In some examples, theaction server 1140 provides information regarding which codes havetriggered the access of secondary content to an action auditor 1145,which may be located or otherwise associated with the ratings server190.

Based on access information provided by the example action server 1140and/or based on secondary content access and/or selection informationprovided by the example secondary content presentation device 150 and/orthe example media server 105, the example action auditor 1145 of FIG. 11tabulates data representative of exposures (e.g., invitations to viewsecondary content) and/or secondary content consumption (e.g., actual“click-throughs”) that have occurred. Such information can be used todetermine, for example, the effectiveness of an advertising campaign.Moreover, such information may be used to adjust and/or determine thecost(s) to the user 1105 for associating secondary content with primarymedia content and/or portions thereof.

To encode actions, secondary content, invitations for secondary content,and/or links to secondary content into primary media content, theexample secondary content server 175 includes an action encoder 1150.Thus, codes in primary media content are not restricted to onlyidentifying the primary media content for audience measurement purposesbut may, additionally or alternatively, be dual use codes correspondingto secondary content and/or links thereto. An example of implementingthe example action encoder 1150 of FIG. 11 is described below inconnection with FIGS. 18-21, and 38-47.

To build and/or add secondary content items to a secondary contentschedule based on loyalty and/or affinity groups, the example secondarycontent server 175 of FIG. 11 includes a loyalty-based scheduler 1160.The example loyalty-based scheduler 1160 of FIG. 11 tabulates whichprimary media content is viewed by different persons and selectssecondary content based on their loyalty and/or frequency of consumingparticular programs, particular advertisements and/or programsassociated with particular content providers 135. Additionally oralternatively, the example loyalty-based scheduler 1160 may addsecondary media content to a secondary content schedule based on aperson's affinity to consume and/or respond to the same programs,advertisements and/or content providers 135 as another person. Anexample manner of implementing the example loyalty-based scheduler 1160is described below in connection with FIG. 32.

The example loyalty-based scheduler 1160 may be used to reward certainusers with special offers based the degree of loyalty that a userexhibits towards certain primary media content and/or contentprovider(s) 130. Loyalty may be determined based on any number and/ortype(s) of criteria including, but not limited to, number of hours spentconsuming certain primary media content and/or episodes/telecasts ofcertain primary media content, the diversity of shows watched on aparticular content delivery network, how often the user activates and/orselects secondary content offers, etc. Loyalty may be expressed on anynumber and/or type(s) of scales based on any number and/or type(s) ofgradations. For example, loyalty may be expressed as the number of timesan episode of a particular TV show has been watched in the last tendays.

While an example manner of implementing the example secondary contentserver 175 of FIG. 1 has been illustrated in FIG. 11, one or more of theinterfaces, data structures, elements, processes and/or devicesillustrated in FIG. 11 may be combined, divided, re-arranged, omitted,eliminated and/or implemented in any other way. Further, the exampleclient interface 1110, the example action register 1115, the exampleaction database 1120, the example action scheduler 1125, the exampleprogram database 1130, the example content database 1135, the exampleaction server 1140, the example action auditor 1145, the example actionencoder 1150, the example loyalty-based scheduler 1160 and/or, moregenerally, the example secondary content server 175 of FIG. 11 may beimplemented by hardware, software, firmware and/or any combination ofhardware, software and/or firmware. Thus, for example, any of theexample client interface 1110, the example action register 1115, theexample action database 1120, the example action scheduler 1125, theexample program database 1130, the example content database 1135, theexample action server 1140, the example action auditor 1145, the exampleaction encoder 1150, the example loyalty-based scheduler 1160 and/or,more generally, the example secondary content server 175 may beimplemented by one or more circuit(s), programmable processor(s),ASIC(s), PLD(s), FPLD(s), and/or FPGA(s), etc. When any apparatus claimof this patent incorporating one or more of these elements is read tocover a purely software and/or firmware implementation, at least one ofthe example client interface 1110, the example action register 1115, theexample action database 1120, the example action scheduler 1125, theexample program database 1130, the example content database 1135, theexample action server 1140, the example action auditor 1145, the exampleaction encoder 1150, the example loyalty-based scheduler 1160 and/or,more generally, the example secondary content server 175 are herebyexpressly defined to include a tangible article of manufacture such as atangible computer-readable medium such as those described below inconnection with FIG. 17 storing the firmware and/or software. Furtherstill, the example secondary content server 175 may include interfaces,data structures, elements, processes and/or devices instead of, or inaddition to, those illustrated in FIG. 11 and/or may include more thanone of any or all of the illustrated interfaces, data structures,elements, processes and/or devices.

FIG. 12 illustrates an example data structure that may be used toimplement the example action database 1120 of FIG. 11. The example datastructure of FIG. 12 includes a plurality of entries 1205 for respectiveactions. To identify an action, each of the example entries 1205 of FIG.12 includes an action identifier (ID) field 1210. Each of the exampleaction ID fields 1210 of FIG. 12 contains one or more numbers and/orletters that uniquely identify a particular action (e.g., particularsecondary content and/or a link to particular secondary content).

To identify a client, person and/or organization associated with anaction, each of the example entries 1205 of FIG. 12 includes a clientfield 1215. Each of the example client fields 1215 of FIG. 12 includesone or more numbers and/or letters that uniquely identify a particularuser, person, client and/or organization that is associated with,defined, leased, purchased and/or owns the code time slot and/or thesecondary content associated with the action 1205.

To identify an action type, each of the example entries 1205 of FIG. 12includes a type field 1220. Each of the example type fields 1220 of FIG.12 includes one or more numbers, letters and/or codes that identify atype of the action 1205. Example action types include, but are notlimited to, web access, phone dialing, and/or pass through to a localapplet.

To specify the action, each of the example entries 1205 of FIG. 12includes a script field 1225. Each of the example script fields 1225 ofFIG. 12 includes text and/or command(s) that define the action 1205.Example scripts include, but are not limited to, a URL, a phone number,a target applet, and/or an OS command.

To define when an action is valid, each of the example entries 1205 ofFIG. 12 includes a valid field 1230. Each of the example valid fields1230 of FIG. 12 includes one or more times and/or dates that define oneor more time periods during which the action 1205 is valid and/oractivatable.

To define how the action is presented, each of the example entries 1205of FIG. 12 includes an invite field 1235. Each of the example invitefields 1235 of FIG. 12 defines how an invitation to the action 1205 isto be displayed in, for example, the lower portion 430 of the exampleuser interface of FIG. 4. For example, the invite field 1235 may defineand/or reference a bit-mapped image to be displayed.

To define whether the action may be saved, each of the example entries1205 of FIG. 12 includes a save field 1240. Each of the example savefields 1240 of FIG. 12 contains a value that represents whether theaction can be saved at the secondary content presentation device 150and/or the media server 105 for subsequent retrieval and/or display atthe secondary content presentation device 150 and/or the media server105. In some examples, the save field 1240 defines a time period duringwhich the action 1205 may be saved at the secondary content presentationdevice 150 and/or the media server 105 and/or a time at which the action1205 is to be flushed from the cache.

While an example data structure that may be used to implement theexample action database 1120 of FIG. 11 has been illustrated in FIG. 12,one or more of the entries and/or fields may be combined, divided,re-arranged, omitted, eliminated and/or implemented in any other way.Moreover, the example data structure of FIG. 12 may include fieldsinstead of, or in addition to, those illustrated in FIG. 12 and/or mayinclude more than one of any or all of the illustrated fields.

FIG. 13 illustrates an example data structure that may be used toimplement the example content database 1135 of FIG. 11. The example datastructure of FIG. 13 includes a plurality of entries 1305 for respectivecombinations of primary media content and actions (e.g., secondarycontent). To identify primary media content and/or any portion thereof,each of the example entries 1305 of FIG. 13 includes a content ID field1310. Each of the example content ID fields 1310 of FIG. 13 contains oneor more numbers and/or letters that uniquely identify a particularprimary media content and/or portion thereof. Example content IDsidentify particular primary media content and/or a particular segment ofprimary media content.

To identify an action, each of the example entries 1305 of FIG. 13includes an action ID field 1315. Each of the example action ID fields1315 of FIG. 13 contains one or more numbers and/or letters thatuniquely identify a particular action (e.g., particular secondarycontent and/or a link to particular secondary content) that has beenassociated with the primary media content and/or portion thereofidentified in the content ID field 1310.

To identify when the action ID 1315 is validly associated with thecontent ID 1310, each of the example entries 1305 of FIG. 13 includes aday field 1320 and a time field 1325. Each of the example day fields1320 of FIG. 13 lists and/or defines one or more particular days onwhich the action ID 1315 is validly associable with the content ID 1310.In particular, if a request for secondary content associated with thecontent ID 1310 is received, the secondary content associated with theaction ID 1315 is only returned if the current day falls within therange and/or set of days defined by the day field 1320. Likewise, eachof the example time fields 1325 list and/or define one or time portionson which the action ID 1315 is validly associable with the content ID1310.

To record access of the secondary content, each of the example entries1305 of FIG. 13 includes a count field 1330. Each of the example countfields 1330 of FIG. 13 includes one or move values that represent thenumber of times that an invitation has been presented for the secondarycontent (e.g., displayed in an example user interface of FIG. 4), andthe number of times that the corresponding secondary content waspresented (e.g., displayed in the example user interface of FIG. 5).

While an example data structure that may be used to implement theexample content database 1135 of FIG. 11 has been illustrated in FIG.13, one or more of the entries and/or fields may be combined, divided,re-arranged, omitted, eliminated and/or implemented in any other way.Moreover, the example data structure of FIG. 13 may include fieldsinstead of, or in addition to, those illustrated in FIG. 13 and/or mayinclude more than one of any or all of the illustrated fields.

FIGS. 14, 15 and 16 illustrate example secondary content delivery flowsthat may be implemented using the example secondary content server 175of FIGS. 1 and 11. In the illustrated example of FIG. 14, actions and/orsecondary content are encoded by the example action encoder 1150 andincluded in primary media content broadcast by a content provider 135.Thus, the data and/or information embedded into the primary mediacontent represents actual secondary content as opposed to simply being acode, identifier and/or index that may be used to subsequently retrievea link to secondary content and/or to retrieve the secondary content. Insuch circumstances, the secondary content presentation device 150 can,by decoding such codes, directly obtain the secondary content and/oractions without having to query the example secondary content server 175for the links and/or secondary content. The data and/or informationembedded by the example action encoder 1150 may be in addition to and/orinstead of codes embedded into the primary media content by a contentencoder 1405 associated with the content provider 135. As illustrated inFIG. 14, the example secondary content presentation device 150 notifiesthe example action auditor 1145 of presentation of the secondary contentfor accounting, audience measurement and/or auditing purposes.

In the illustrated example of FIG. 15, the action encoder 1150 encodesidentifiers (e.g., a link) into the primary media content, which may beused to obtain secondary media content. Thus, the embedded informationindirectly represents secondary content. Accordingly, when the secondarycontent presentation device 150 detects an embedded link associated withsecondary content, it can utilize the link to obtain the secondarycontent rather than having to first query the secondary content server175 to obtain the link based on a detected, decoded and/or extractedcode and/or identifier.

In the illustrated example of FIG. 16, the querying for and obtaining ofsecondary content by the secondary content presentation device 150 isresponsive to only those codes embedded by the content provider 135.Accordingly, when the secondary content presentation device 150 detectsa code it interacts with the action server 1140 to retrieve thesecondary content and/or links to secondary content associated with thedetected code.

FIG. 17 illustrates example machine-accessible instructions that may beexecuted to implement the example secondary content presentation device150 of FIGS. 1 and 3. A processor, a controller and/or any othersuitable processing device may be used and/or programmed to execute theexample machine-accessible instructions of FIG. 17. For example, themachine-accessible instructions of FIG. 17 may be embodied in codedinstructions stored on a tangible computer-readable medium. As usedherein, the term tangible computer-readable medium is expressly definedto include any type of computer readable storage and to excludepropagating signals. Example tangible computer readable medium includeany type of volatile and/or non-volatile physical memory and/or physicalmemory device, a flash memory, a CD, a DVD, a floppy disk, a read-onlymemory (ROM), a random-access memory (RAM), a programmable ROM (PROM),an electronically-programmable ROM (EPROM), and/or anelectronically-erasable PROM (EEPROM), an optical storage disk, anoptical storage device, magnetic storage disk, a magnetic storagedevice, a cache, and/or any other storage media in which information isstored for any duration (e.g., for extended time periods, permanently,brief instances, for temporarily buffering, and/or for caching of theinformation) and which can be accessed by a processor, a computer and/orother machine having a processor, such as the example processor platformP100 discussed below in connection with FIG. 24. As used herein, theterm non-transitory computer readable medium is expressly defined toinclude any type of computer readable medium and to exclude propagatingsignals. Combinations of the above are also included within the scope ofcomputer-readable media. Machine-readable instructions comprise, forexample, instructions and data that cause a processor, a computer and/ora machine have a processor to perform one or more particular processes.Alternatively, some or all of the example machine-accessibleinstructions of FIG. 17 may be implemented using any combination(s) ofASIC(s), PLD(s), FPLD(s), FPGA(s), discrete logic, hardware, firmware,etc. Also, some or all of the example process of FIG. 17 may beimplemented manually or as any combination of any of the foregoingtechniques, for example, any combination of firmware, software, discretelogic and/or hardware. Further, many other methods of implementing theexample operations of FIG. 17 may be employed. For example, the order ofexecution of the blocks may be changed, and/or one or more of the blocksdescribed may be changed, eliminated, sub-divided, or combined.Additionally, any or all of the example machine-accessible instructionsof FIG. 17 may be carried out sequentially and/or carried out inparallel by, for example, separate processing threads, processors,devices, discrete logic, circuits, etc.

The example machine-accessible instructions of FIG. 17 may be executedto implement three parallel processes that may be implemented by, forexample, separate substantially asynchronous processes executing withinan OS. In a first process, the example machine-accessible instructionsof FIG. 17 begin with the example decoder 310 detecting and decoding anycodes present in the audio signals 172 and 173 (block 1705). When a codeis detected and/or a trigger received from the example media server 105(block 1710), the secondary content module 170 sends a request forsecondary content to the example media server 105 and/or the examplesecondary content server 175 (block 1715). Control then returns to block1705 to continue detecting and decoding codes.

In a second process, the example machine-accessible instructions of FIG.17 begins when the example secondary content module 170 receives linksto and/or invitations for secondary content from, for example, theexample media server 105 and/or the example secondary content server 175(block 1720). The secondary content module 170 displays the receivedlinks and/or invitations via the example user interface module 325 andthe display 330 using, for example, the example user interface of FIG. 4(block 1725). Control then returns to the block 1720 to wait foradditional secondary content information.

In a third process, the example machine-accessible instructions of FIG.17 begin when a user selects and/or activates a secondary content linkvia the input device(s) 335 (block 1730). The secondary content module170 obtains and displays the secondary content associated with theselected and/or activated link from a local cache 340, the example mediaserver 105 and/or the example secondary content server 175 (block 1735).When display of the secondary content is ended by the user (e.g., usingthe example close button 510 of FIG. 5) (block 1740), the secondarycontent module 170 displays previously received links and/or invitationsvia the example user interface module 325 and the display 330 using, forexample, the example user interface of FIG. 4 (block 1745). Control thenreturns to the block 1730 to wait for another link to be selected and/oractivated.

Audio Codes and Watermarks

An example encoding and decoding system 1800 is shown in FIG. 18. Theexample system 1800 may be, for example, a television audiencemeasurement system, which will serve as a context for furtherdescription of the encoding and decoding processes described herein. Theexample system 1800 of FIG. 18 includes an encoder 1802 that adds a code1803 to an audio signal 1804 to produce an encoded audio signal. Thecode 1803 may be representative of any selected information. Forexample, in a media monitoring context, the code 1803 may berepresentative of and/or identify broadcast primary media content suchas a television broadcast, a radio broadcast, or the like. Additionally,the code 1803 may include timing information indicative of a time atwhich the code 1803 was inserted into audio or a media broadcast time.Alternatively, as described below, the code may include controlinformation that is used to control the behavior of one or more targetdevices. It should be understood that the example encoder 1802 of FIGS.18 and 19 and/or the example encoders 3802 of FIGS. 38 and 39 may beused to implement the example content provider(s) 135 of FIG. 1 and/orthe example action encoder 1150 of FIG. 11. Other example encoders thatmay be used to implement the example content provider(s) 135 aredescribed in U.S. patent application Ser. No. 12/604,176, entitled“Methods and Apparatus to Extract Data Encoded in Media Content,” andfiled Oct. 22, 2009.

The audio signal 1804 may be any form of audio including, for example,voice, music, noise, commercial advertisement audio, audio associatedwith a television program, live performance, etc. In the example of FIG.18, the encoder 1802 passes the encoded audio signal to a transmitter1806. The transmitter 1806 transmits the encoded audio signal along withany video signal 1808 associated with the encoded audio signal. While,in some instances, the encoded audio signal may have an associated videosignal 1808, the encoded audio signal need not have any associatedvideo.

Although the transmit side of the example system 1800 shown in FIG. 18shows a single transmitter 1806, the transmit side may be much morecomplex and may include multiple levels in a distribution chain throughwhich the audio signal 1804 may be passed. For example, the audio signal1804 may be generated at a national network level and passed to a localnetwork level for local distribution. Accordingly, although the encoder1802 is shown in the transmit lineup prior to the transmitter 1806, oneor more encoders may be placed throughout the distribution chain of theaudio signal 1804. Thus, the audio signal 1804 may be encoded atmultiple levels and may include embedded codes associated with thosemultiple levels. Further details regarding encoding and example encodersare provided below.

The transmitter 1806 may include one or more of a radio frequency (RF)transmitter that may distribute the encoded audio signal through freespace propagation (e.g., via terrestrial or satellite communicationlinks) or a transmitter used to distribute the encoded audio signalthrough cable, fiber, etc. In some examples, the transmitter 1806 may beused to broadcast the encoded audio signal throughout a broadgeographical area. In other cases, the transmitter 1806 may distributethe encoded audio signal through a limited geographical area. Thetransmission may include up-conversion of the encoded audio signal toradio frequencies to enable propagation of the same. Alternatively, thetransmission may include distributing the encoded audio signal in theform of digital bits or packets of digital bits that may be transmittedover one or more networks, such as the Internet, wide area networks, orlocal area networks, as described above in connection with FIG. 1. Thus,the encoded audio signal may be carried by a carrier signal, byinformation packets or by any suitable technique to distribute the audiosignals.

When the encoded audio signal is received by a receiver 1810, which, inthe media monitoring context, may be located at a statistically selectedmetering site 1812, the audio signal portion of the received programsignal is processed to recover the code, even though the presence ofthat code is imperceptible (or substantially imperceptible) to alistener when the encoded audio signal is presented by speakers 1814 ofthe receiver 1810. To this end, a decoder 1816 is connected eitherdirectly to an audio output 1818 available at the receiver 1810 or to amicrophone 1820 placed in the vicinity of the speakers 1814 throughwhich the audio is reproduced. The received audio signal can be eitherin a monaural or stereo format. Further details regarding decoding andexample decoders are provided below. It should be understood that theexample decoder 1816 and the example microphone 1820 of FIGS. 18 and 22and/or the example microphone 3820 of FIG. 38 may be used to implementthe example decoder 310 and the example audio input interface 305 ofFIG. 3, respectively, and/or the example secondary content triggerer 180of FIG. 1. Other example decoders that may be used to implement theexample decoder 310 are described in U.S. patent application Ser. No.12/604,176, entitled “Methods and Apparatus to Extract Data Encoded inMedia Content,” and filed Oct. 22, 2009.

Audio Encoding

As explained above, the encoder 1802 inserts one or more inaudible (orsubstantially inaudible) codes into the audio 1804 to create encodedaudio. An example manner of implementing the example encoder 1802 ofFIG. 18 is shown in FIG. 19. In some implementations, the exampleencoder 1802 of FIG. 19 includes a sampler 1902 that receives the audio1804. The sampler 1902 is coupled to a masking evaluator 1904, whichevaluates the ability of the sampled audio to hide codes therein. Thecode 1803 is provided to a code frequency selector 1906 that determinesaudio code frequencies that are used to represent the code 1803 to beinserted into the audio. The code frequency selector 1906 may includeconversion of codes into symbols and/or any suitable detection orcorrection encoding. An indication of the designated code frequenciesthat will be used to represent the code 1803 are passed to the maskingevaluator 1904 so that the masking evaluator 1904 is aware of thefrequencies for which masking by the audio 1804 should be determined.Additionally, the indication of the code frequencies is provided to acode synthesizer 1908 that produces sine wave signals having frequenciesdesignated by the code frequency selector 1906. A combiner 1910 receivesboth the synthesized code frequencies from the code synthesizer 1908 andthe audio that was provided to the sampler and combines the two toproduce encoded audio.

In some examples in which the audio 1804 is provided to the encoder 1802in analog form, the sampler 1902 is implemented using ananalog-to-digital (A/D) converter or any other suitable digitizer. Thesampler 1902 may sample the audio 1804 at, for example, 48,000 Hertz(Hz) or any other sampling rate suitable to sample the audio 1804 whilesatisfying the Nyquist criteria. For example, if the audio 1804 isfrequency-limited at 15,000 Hz, the sampler 1902 may operate at 30,000Hz. Each sample from the sampler 1902 may be represented by a string ofdigital bits, wherein the number of bits in the string indicates theprecision with which the sampling is carried out. For example, thesampler 1902 may produce 8-bit, 16-bit, 24-bit, or 32-bit.

In addition to sampling the audio 1804, the example sampler 1902accumulates a number of samples (i.e., an audio block) that are to beprocessed together. For example, the example sampler 1902 accumulates a512 sample audio block that is passed to the masking evaluator 1904 atone time. Alternatively, in some examples, the masking evaluator 1904may include an accumulator in which a number of samples (e.g., 512) maybe accumulated in a buffer before they are processed.

The masking evaluator 1904 receives or accumulates the samples (e.g.,512 samples) and determines an ability of the accumulated samples tohide code frequencies to human hearing. That is, the masking evaluatordetermines if code frequencies can be hidden within the audiorepresented by the accumulated samples by evaluating each critical bandof the audio as a whole to determine its energy and determining thenoise-like or tonal-like attributes of each critical band anddetermining the sum total ability of the critical bands to mask the codefrequencies. Critical frequency bands, which were determined byexperimental studies carried out on human auditory perception, may varyin width from single frequency bands at the low end of the spectrum tobands containing ten or more adjacent frequencies at the upper end ofthe audible spectrum. If the masking evaluator 1904 determines that codefrequencies can be hidden in the audio 1804, the masking evaluator 1904indicates the amplitude levels at which the code frequencies can beinserted within the audio 1804, while still remaining hidden andprovides the amplitude information to the code synthesizer 1908.

In some examples, the masking evaluator 1904 conducts the maskingevaluation by determining a maximum change in energy E_(b) or a maskingenergy level that can occur at any critical frequency band withoutmaking the change perceptible to a listener. The masking evaluationcarried out by the masking evaluator 1904 may be carried out as outlinedin the Moving Pictures Experts Group—Advanced Audio Encoding (MPEG-AAC)audio compression standard ISO/IEC 13818-7:1997, for example. Theacoustic energy in each critical band influences the masking energy ofits neighbors and algorithms for computing the masking effect aredescribed in the standards document such as ISO/IEC 13818-7:1997. Theseanalyses may be used to determine for each audio block the maskingcontribution due to tonality (e.g., how much the audio being evaluatedis like a tone) as well as noise like (i.e., how much the audio beingevaluated is like noise) features. Further analysis can evaluatetemporal masking that extends masking ability of the audio over shorttime, typically, for 50-100 ms. The resulting analysis by the maskingevaluator 1904 provides a determination, on a per critical band basis,the amplitude of a code frequency that can be added to the audio 1804without producing any noticeable audio degradation (e.g., without beingaudible).

In some examples, the code frequency selector 1906 is implemented usinga lookup table that relates an input code 1803 to a state, wherein eachstate is represented by a number of code frequencies that are to beemphasized in the encoded audio signal. For example, the code frequencyselector 1906 may include information relating symbols or data states tosets of code frequencies that redundantly represent the data states. Thenumber of states selected for use may be based on the types of inputcodes. For example, an input code representing two bits may be convertedto code frequencies representing one of four symbols or states (e.g.,2²). In other examples, an input code representing four bits ofinformation is represented by one of 16 symbols or states (e.g., 2⁴).Some other encoding may be used to build in error correction whenconverting the code 1803 to one or more symbols or states. Additionally,in some examples, more than one code may be embedded in the audio 1804.

An example chart illustrating a code frequency configuration is shown inFIG. 20A at reference numeral 2000. The chart includes frequency indicesthat range in value from 360 to 1366. These frequency indices correspondto frequencies of the sine waves to be embedded into an audio signalwhen viewed in the frequency domain via a Discrete Fourier transform(DFT) of a block of 18,432 samples. The reason that reference is made tofrequency indices rather than actual frequencies is that the frequenciesto which the indices correspond vary based on the sampling rate usedwithin the encoder 1802 and the number of samples processed by thedecoder 1816. The higher the sampling rate, the closer in frequency eachof the indices is to its neighboring indices. Conversely, a low samplingrate results in adjacent indices that are relatively widely space infrequency. For example, at a sampling rate of 48,000 Hz, the spacingbetween the indices shown in the chart 2000 of FIG. 20A is 2.6 Hz. Thus,frequency index 360 corresponds to 936 Hz (2.6 Hz×360). Of course, othersampling rates and frequency indices may be selected. For example, oneor more ranges of frequency indices may be selected and/or used to avoidinterfering with frequencies used to carry other codes and/orwatermarks. Moreover, the selected and/or used ranges of frequenciesneed not be contiguous. In some examples, frequencies in the ranges 0.8kilohertz (kHz) to 1.03 kHz and 2.9 kHz to 4.6 kHz are used. In otherexamples, frequencies in the ranges 0.75 kHz to 1.03 kHz and 2.9 kHz to4.4 kHz are used.

As shown in FIG. 20A, the chart 2000 includes a top row 2002 listing 144different states or symbols represented in columns, wherein the chart2000 shows the first three states and the last state. The states areselected to represent codes or portions of codes. The states between thethird state and the last state are represented by dashed boxes for thesake of clarity. Each of the states occupies a corresponding column inthe chart 2000. For example, state S1 occupies a column denoted withreference numeral 2004. Each column includes a number of frequencyindices representing a frequency in each of seven different code bands,which are denoted in the left-hand column 2006 of the chart 2000. Forexample, as shown in column 2004, the state S1 is represented byfrequency indices 360, 504, 648, 792, 936, 1080, and 1224. To send oneof the 144 states, the code indices in the column of the selected stateare emphasized in a block of 18,432 samples. Thus, to send state S1,indices 360, 504, 6489, 792, 936, 1080, and 1224 are emphasized. In someexample encoders 1802, only the indices of one of the states are everemphasized at one time.

As shown in FIG. 20A, each code band includes sequentially numberedfrequency indices, one of which corresponds to each state. That is, CodeBand 0 includes frequency indices 360-503, each corresponding to one ofthe 144 different states/symbols shown in the chart 2000. Additionally,adjacent code bands in the system are separated by one frequency index.For example, Code Band 0 ranges from index 360 to index 503 and adjacentCode Band 1 ranges from index 504 to index 647. Thus, Code Band 0 isspaced one frequency index from adjacent Code Band 1. Advantageously,the code frequencies shown in FIG. 20A are close to one another infrequency and, thus, are affected in relatively the same manner bymultipath interference. Additionally, the high level of redundancy inthe chart 2000 enhances the ability to recover the code.

Thus, if the code frequency selector 1906 operates premised on the chart2000 of FIG. 20A, when an input code to the code frequency selector 1906is encoded or mapped to state S1, the code frequency selector 1906indicates to the masking evaluator 1904 and the code synthesizer 1908that frequency indices 360, 504, 648, 792, 936, 1080, and 1224 should beemphasized in the encoded signal and, therefore, the code synthesizer1908 should produce sine waves having frequencies corresponding to thefrequency indices 360, 504, 648, 792, 936, 1080, and 1224, and that suchsine waves should be generated with amplitudes specified by the maskingevaluator 1904 so that the generated sine waves can be inserted into theaudio 1804, but will be inaudible (or substantially inaudible). By wayof further example, when an input code identifies that state S144 shouldbe encoded into the audio 1804, the code frequency selector 1906identifies frequency indices 503, 647, 791, 935, 1079, 1223, and 1366 tothe masking evaluator 1904 and the code synthesizer 1908 so thatcorresponding sine waves can be generated with appropriate amplitudes.

The encoding used to select states in the chart 2000 to conveyinformation may include data blocks and synchronization blocks. Forexample, the message to be encoded by the system using these 144different states includes a synchronization block that is followed byseveral data blocks. Each of the synchronization block and the datablocks is encoded into 18,432 samples and is represented by emphasizingthe indices of one of the states shown in one column of the chart 2000.

For example, a synchronization block is represented by emphasizing theindices of one of 16 states selected to represent synchronizationinformation. That is, the synchronization block indicates the start ofone of 16 different message types. For example, when considering mediamonitoring, network television stations may use a first state torepresent synchronization and a local affiliate may use a second stateto represent synchronization. Thus, at the start of a transmission, oneof 16 different states is selected to represent synchronization andtransmitted by emphasizing the indices associated with that state.Information payload data follows synchronization data.

In the foregoing example, with regard to how these 16 statesrepresenting synchronization information are distributed throughout the144 states, in some examples the 16 states are selected so that afrequency range including first code frequencies representing each ofthose 16 states is larger than a frequency amount separating thatfrequency range from an adjacent frequency range including second codefrequencies also representing each of those 16 states. For example, the16 states representing the synchronization information may be spacedevery 9 states in the table above, such that states S1, S, S0, S19, S28,S37, S46, S54, S63, S72, S81, S90, S99, S108, S117, S126, S135 representpossible states that the synchronization information may take. In CodeBand 0 and Code Band 1, this corresponds to a width in frequency indicesof 135 indices. The frequency spacing between the highest possiblesynchronization state (S135) of Code Band 0 and the lowest possiblesynchronization state (S1) of Code Band 1 is 10 frequency indices. Thus,the range of each collection of frequency indices representing thesynchronization information is much larger (e.g., 135 indices) than theamount separating adjacent collections (e.g., 10 indices).

In this example, the remaining 128 states of the 144 state space thatare not used to represent synchronization may be used to transmitinformation data. The data may be represented by any number of suitablestates required to represent the number of desired bits. For example, 16states may be used to represent four bits of information per state, or128 states may be used to represent seven bits of information per state.In some examples, the states selected to represent data are selectedsuch that a frequency range including first code frequenciesrepresenting each of the data states is larger than a frequency amountseparating that frequency range from an adjacent frequency rangeincluding second code frequencies also representing each of the datastates. Thus, states used to represent potential data include at leastone substantially low numbered state (e.g., S2) and at least onesubstantially high numbered state (e.g., S144). This ensures that theranges including states that may be used to represent data occupy a widebandwidth within their respective code bands, and that the spacingbetween adjacent ranges are narrow.

The encoder 1802 may repeat the encoding process and, thereby, encode anumber of audio blocks with a particular code. That is, the selectedcode frequencies may be inserted into several consecutive 512-sampleaudio blocks. In some examples, the code frequencies representingsymbols may be repeated in 36 consecutive audio blocks of 512 samples or72 overlapping blocks of 256 samples. Thus, at the receive side, when18,432 samples are processed by a Fourier transform such as a DFT, theemphasized code frequencies will be visible in the resulting spectrum.

FIG. 20B shows an example alternative chart 2030 that may be used by thecode frequency selector 1908, wherein the chart 2030 lists four statesin the first row 2032, each of which includes corresponding frequencyindices listed in seven code bands 2034. These frequency indicescorrespond to frequencies of the sinusoids to be embedded into an audiosignal when viewed in the frequency domain via a Fourier transform suchas a DFT of a block of 512 samples. By way of example, when state S1 isto be sent, the code frequency selector 1906 indicates that frequencyindices 10, 14, 18, 22, 26, 30, and 34 are to be used. As describedabove, the indication of these frequencies is communicated to themasking evaluator 1904 and the code synthesizer 1908, so that sine waveshaving the proper amplitude and corresponding to the indicated frequencyindices may be generated for addition to the audio 1804. In exampleencoders 1802 operating according to the chart 2030, the codefrequencies corresponding to the desired symbol are encoded into 19overlapping blocks of 256 samples in order to make it detectable.

As with the chart 2000 of FIG. 20A, the chart 2030 indicates that thecode bands are separated by the same frequency distance as the frequencyindices representing adjacent symbol. For example, Code Band 0 includesa code frequency component having a frequency index of 13, which is onefrequency index from the Code Band 1 frequency index 14 representing thestate S1.

Chart 2060 of FIG. 20C shows another example that may be used by thecode frequency selector 1908, wherein the chart 2060 lists 24 states inthe first row 2062, each of which includes corresponding frequencyindices listed in seven code bands 2064. These frequency indicescorrespond to frequencies of the sinusoids to be embedded into an audiosignal when viewed in the frequency domain via a Fourier transform suchas a DFT of a block of 3072 samples. By way of example, when state S1 isto be sent, the code frequency selector 1906 indicates that frequencyindices 60, 84, 108, 132, 156, 180, and 204 are to be used. As describedabove, the indication of these frequencies is communicated to themasking evaluator 1904 and the code synthesizer 1908, so that sine waveshaving the proper amplitude and corresponding to the indicated frequencyindices may be generated for addition to the audio 1804.

In example encoders 1802 operating according to the chart 2060 of FIG.20C, the code frequencies corresponding to the desired symbol areencoded in 182 overlapping blocks of 256 samples. In suchimplementations the first 16 columns may be used as data symbols and the17th column may be used as a synchronization symbol. The remaining sevencolumns could be used for special data such as Video On Demand—forexample, columns 18, 19, 20, 21, 22, 23 could be used as auxiliary datasymbols and these will be decoded as such only when an auxiliarysynchronization symbol is present in column 24.

As with the charts 2000 and 2030 described above, the chart 2060indicates that the code bands are separated by the same frequencydistance as the frequency indices representing adjacent symbol. Forexample, Code Band 0 includes a code frequency component having afrequency index of 83, which is one frequency index from the Code Band 1frequency index 84 representing the state S1.

Returning now to FIG. 19, as described above, the code synthesizer 1908receives from the code frequency selector 1906 an indication of thefrequency indices required to be included to create an encoded audiosignal including an indication of the input code. In response to theindication of the frequency indices, the code synthesizer 1908 generatesa number of sine waves (or one composite signal including multiple sinewaves) having the identified frequencies. The synthesis may result insine wave signals or in digital data representative of sine wavesignals. In some examples, the code synthesizer 1908 generates the codefrequencies with amplitudes dictated by the masking evaluator 1904. Inother examples, the code synthesizer 1908 generates the code frequencieshaving fixed amplitudes and those amplitudes may be adjusted by one ormore gain blocks (not shown) that are within the code sequencer 1908 orare disposed between the code synthesizer 1908 and the combiner 1910.

While the foregoing describes an example code synthesizer 1908 thatgenerates sine waves or data representing sine waves, other exampleimplementations of code synthesizers are possible. For example, ratherthan generating sine waves, another example code synthesizer 1908 mayoutput frequency domain coefficients that are used to adjust amplitudesof certain frequencies of audio provided to the combiner 1910. In thismanner, the spectrum of the audio may be adjusted to include therequisite sine waves.

The combiner 1910 receives both the output of the code synthesizer 1908and the audio 1804 and combines them to form encoded audio. The combiner1910 may combine the output of the code synthesizer 1908 and the audio1804 in an analog or digital form. If the combiner 1910 performs adigital combination, the output of the code synthesizer 1908 may becombined with the output of the sampler 1902, rather than the audio 1804that is input to the sampler 1902. For example, the audio block indigital form may be combined with the sine waves in digital form.Alternatively, the combination may be carried out in the frequencydomain, wherein frequency coefficients of the audio are adjusted inaccordance with frequency coefficients representing the sine waves. As afurther alternative, the sine waves and the audio may be combined inanalog form. The encoded audio may be output from the combiner 1910 inanalog or digital form. If the output of the combiner 1910 is digital,it may be subsequently converted to analog form before being coupled tothe transmitter 1806.

While an example manner of implementing the example encoder 1802 of FIG.18 has been illustrated in FIG. 19, one or more of the interfaces, datastructures, elements, processes and/or devices illustrated in FIG. 19may be combined, divided, re-arranged, omitted, eliminated and/orimplemented in any other way. Further, the example sampler 1902, theexample masking evaluator 1904, the example code frequency selector1906, the example code synthesizer 1908, the example combiner 1910and/or, more generally, the example encoder 1802 of FIG. 19 may beimplemented by hardware, software, firmware and/or any combination ofhardware, software and/or firmware. Thus, for example, any of theexample sampler 1902, the example masking evaluator 1904, the examplecode frequency selector 1906, the example code synthesizer 1908, theexample combiner 1910 and/or, more generally, the example encoder 1802may be implemented by one or more circuit(s), programmable processor(s),ASIC(s), PLD(s), FPLD(s), and/or FPGA(s), etc. When any apparatus claimof this patent incorporating one or more of these elements is read tocover a purely software and/or firmware implementation, at least one ofthe example sampler 1902, the example masking evaluator 1904, theexample code frequency selector 1906, the example code synthesizer 1908,the example combiner 1910 and/or, more generally, the example encoder1802 are hereby expressly defined to include a tangible article ofmanufacture such as a tangible computer-readable medium such as thosedescribed above in connection with FIG. 17 storing the firmware and/orsoftware. Further still, the example encoder 1802 may includeinterfaces, data structures, elements, processes and/or devices insteadof, or in addition to, those illustrated in FIG. 19 and/or may includemore than one of any or all of the illustrated interfaces, datastructures, elements, processes and/or devices.

FIG. 21 illustrates example machine-accessible instructions 2100 thatmay be executed to implement the example encoder 1802 of FIGS. 18 and19. A processor, a controller and/or any other suitable processingdevice may be used and/or programmed to execute the examplemachine-accessible instructions of FIG. 21. For example, themachine-accessible instructions of FIG. 21 may be embodied in codedinstructions stored on any combination of tangible article ofmanufacture such as a tangible computer-readable medium discussed abovein connection with FIG. 17. Machine-readable instructions comprise, forexample, instructions and data that cause a processor, a computer and/ora machine having a processor (e.g., the example processor platform P100discussed below in connection with FIG. 24) to perform one or moreparticular processes. Alternatively, some or all of the examplemachine-accessible instructions of FIG. 21 may be implemented using anycombination(s) of ASIC(s), PLD(s), FPLD(s), FPGA(s), discrete logic,hardware, firmware, etc. Also, some or all of the example process ofFIG. 21 may be implemented manually or as any combination of any of theforegoing techniques, for example, any combination of firmware,software, discrete logic and/or hardware. Further, many other methods ofimplementing the example operations of FIG. 21 may be employed. Forexample, the order of execution of the blocks may be changed, and/or oneor more of the blocks described may be changed, eliminated, sub-divided,or combined. Additionally, any or all of the example machine-accessibleinstructions of FIG. 21 may be carried out sequentially and/or carriedout in parallel by, for example, separate processing threads,processors, devices, discrete logic, circuits, etc.

The example process 2100 of FIG. 21 begins when the code to be includedin the audio is obtained (block 2102). The code may be obtained via adata file, a memory, a register, an input port, a network connection, orany other suitable technique. After the code is obtained (block 2102),the example process 2100 samples the audio into which the code is to beembedded (block 2104). The sampling may be carried out at 48,000 Hz orat any other suitable frequency. The example process 2100 then assemblesthe audio samples into a block of audio samples (block 2106). The blockof samples may include, for example, 512 audio samples. In someexamples, blocks of samples may include both old samples (e.g., samplesthat have been used before in encoding information into audio) and newsamples (e.g., samples that have not been used before in encodinginformation into audio). For example, a block of 512 audio samples mayinclude 256 old samples and 256 new samples. Upon a subsequent iterationof the example process 400, the 256 new samples from a prior iterationmay be used as the 256 old samples of the next iteration of the exampleprocess 2100.

The example process 2100 then determines the code frequencies that willbe used to include the code (obtained at block 2102) into the audioblock (obtained at block 2106) (block 2108). This is an encoding processin which a code or code bits are converted into symbols that will berepresented by frequency components. As described above, the exampleprocess 2100 may use one or more lookup tables to convert codes to beencoded into symbols representative of the codes, wherein those symbolsare redundantly represented by code frequencies in the audio spectrum.As described above, seven frequencies may be used to redundantlyrepresent the selected symbol in the block of audio. The selection ofsymbols to represent codes may include consideration of the block numberbeing processed error coding, etc.

Having obtained the audio into which the codes are to be included (block2106), as well as the code frequencies that are to be used to representthe codes (block 2108), the process 2100 computes the ability of theaudio block to mask the selected code frequencies (block 2110). Asexplained above, the masking evaluation may include conversion of theaudio block to the frequency domain and consideration of the tonal ornoise-like properties of the audio block, as well as the amplitudes atvarious frequencies in the block. Alternatively, the evaluation may becarried out in the time domain. Additionally, the masking may alsoinclude consideration of audio that was in a previous audio block. Asnoted above, the masking evaluation may be carried out in accordancewith the MPEG-AAC audio compression standard ISO/IEC 13818-7:1997, forexample. The result of the masking evaluation is a determination of theamplitudes or energies of the code frequencies that are to be added tothe audio block, while such code frequencies remain inaudible orsubstantially inaudible to human hearing.

Having determined the amplitudes or energies at which the codefrequencies should be generated (block 2110), the example process 2100synthesizes one or more sine waves having the code frequencies (block2112). The synthesis may result in actual sine waves or may result indigital data equivalent representative of sine waves. Some example sinewaves are synthesized with amplitudes specified by the maskingevaluation. Alternatively, the code frequencies may be synthesized withfixed amplitudes and then amplitudes of the code frequencies may beadjusted subsequent to synthesis.

The example process 2100 then combines the synthesized code frequencieswith the audio block (block 2114). The combination may be carried outthrough addition of data representing the audio block and datarepresenting the synthesized sine waves, or may be carried out in anyother suitable manner.

In another example, the code frequency synthesis (block 2112) and thecombination (block 2114) may be carried out in the frequency domain,wherein frequency coefficients representative of the audio block in thefrequency domain are adjusted per the frequency domain coefficients ofthe synthesized sine waves.

As explained above, the code frequencies are redundantly encoded intoconsecutive audio blocks. In some examples, a particular set of codefrequencies is encoded into 36 consecutive blocks. Thus, the exampleprocess 2100 monitors whether it has completed the requisite number ofiterations (block 2116) (e.g., the process 2100 determines whether theexample process 2100 has been repeated 36 times to redundantly encodethe code frequencies). If the example process 2100 has not completed therequisite iterations (block 2116), the example process 2100 samplesaudio (block 2104), analyses the masking properties of the same (block2110), synthesizes the code frequencies (block 2112) and combines thecode frequencies with the newly acquired audio block (block 2114),thereby encoding another audio block with the code frequencies.

However, when the requisite iterations to redundantly encode the codefrequencies into audio blocks have completed (block 2116), the exampleprocess 2100 obtains the next code to be included in the audio (block2102) and the example process 2100 iterates. Thus, the example process2100 encodes a first code into a predetermined number of audio blocks,before selecting the next code to encode into a predetermined number ofaudio blocks, and so on. It is, however, possible, that there is notalways a code to be embedded in the audio. In that instance, the exampleprocess 2100 may be bypassed. Alternatively, if no code to be includedis obtained (block 2102), no code frequencies will by synthesized (block2112) and, thus, there will be no code frequencies to alter an audioblock. Thus, the example process 2100 may still operate, but audioblocks may not always be modified—especially when there is no code to beincluded in the audio.

Audio Decoding

In general, the decoder 1816 detects the code signal that was insertedinto the audio 1804 to form encoded audio at the encoder 1802. That is,the decoder 1816 looks for a pattern of emphasis in code frequencies itprocesses. Once the decoder 1816 has determined which of the codefrequencies have been emphasized, the decoder 1816 determines, based onthe emphasized code frequencies, the symbol present within the encodedaudio. The decoder 1816 may record the symbols, or may decode thosesymbols into the codes that were provided to the encoder 1802 forinsertion into the audio.

FIG. 22 illustrates an example manner of decoding Nielsen codes and/orimplementing the example decoder 1816 of FIG. 22, the example decoder310 of FIG. 3 and/or the example secondary content triggerer 180 ofFIGS. 1 and 2. While the decoder illustrated in FIG. 22 may be used toimplement any of the decoders 1816, 310 and 180, for ease of discussionthe decoder of FIG. 22 will be referred to as decoder 1816. As shown inFIG. 22, an example decoder 1816 includes a sampler 2202, which may beimplemented using an A/D or any other suitable technology, to whichencoded audio is provided in analog format. As shown in FIG. 18, theencoded audio may be provided by a wired or wireless connection to thereceiver 1810. The sampler 2202 samples the encoded audio at, forexample, a sampling frequency of 48,000 Hz. Of course, lower samplingfrequencies may be advantageously selected in order to reduce thecomputational load at the time of decoding. For example, at a samplingfrequency of 8 kHz the Nyquist frequency is 4 kHz and therefore all theembedded code signal is preserved because its spectral frequencies arelower than the Nyquist frequency. The 18,432-sample DFT block length at48 kHz sampling rate is reduced to 3072 samples at 8 kHz sampling rate.However even at this modified DFT block size the code frequency indicesare identical to the original and range from 360 to 1367.

The samples from the sampler 2202 are provided to a time to frequencydomain converter 2204. The time to frequency domain converter 2204 maybe implemented using a DFT, or any other suitable technique to converttime-based information into frequency-based information. In someexamples, the time to frequency domain converter 2204 may be implementedusing a sliding DFT in which a spectrum is calculated each time a newsample is provided to the example time to frequency converter 2204. Insome examples, the time to frequency domain converter 2204 uses 18,432samples of the encoded audio and determines a spectrum therefrom. Theresolution of the spectrum produced by the time to frequency domainconverter 2204 increases as the number of samples used to generate thespectrum. Thus, the number of samples processed by the time to frequencydomain converter 2204 should match the resolution used to select theindices in the charts of FIGS. 20A, 20B, or 20C.

The spectrum produced by the time to frequency domain converter 2204passes to a code frequency monitor 2206, which monitors all thefrequencies or spectral lines corresponding to the frequency indicesthat can potentially carry codes inserted by the example encoder 1802.For example, if the example encoder 1802 sends data based on the chartof FIG. 20A, the code frequency monitor 2206 monitors the frequenciescorresponding to indices 360-1366.

The monitoring of the code frequencies includes evaluating the spectralenergies at each of the code frequencies. Thus, the code frequencymonitor 2206 normalizes the energies for a specific row of the chart ofFIG. 20A to a maximum energy in that row of the chart. For example,considering the frequency indices corresponding to Code Band 0 of thechart of FIG. 20A, if the frequency corresponding to frequency index 360has the maximum energy of the other frequencies in the row representingCode Band 0 (e.g., frequency indices 361, 362 . . . 503) each of theenergies at the other frequencies corresponding to the indices in CodeBand 0 divided by the energy of the frequency corresponding to frequencyindex 360. Thus, the normalized energy for frequency index 360 will havea value of 1 and all of the remaining frequencies corresponding tofrequency indices in Code Band 0 will have values smaller than 1. Thisnormalization process is repeated for each row of the chart 2000. Thatis, each Code Band in the chart of FIG. 20A will include one frequencyhaving its energy normalized to 1, with all remaining energies in thatCode Band normalized to something less than 1.

Based on the normalized energies produced by the code frequency monitor2206, a symbol determiner 2208 to determines the symbol that was presentin the encoded audio. In some examples, the symbol determiner 2208 sumsall of the normalized energies corresponding to each state. That is, thesymbol determiner 2208 creates 144 sums, each corresponding to a column,or state, in the chart 2000. The column or state having the highest sumof normalized energies is determined to be the symbol that was encoded.The symbol determiner 2208 may use a lookup table similar to the lookuptable of FIG. 20A that can be used to map emphasized frequencies to thesymbols to which they correspond. For example, if state S1 was encodedinto the audio, the normalized energies will generally result in a valueof one for each frequency index representing state S1. That is, ingeneral, all other frequencies in the Code Bands that do not correspondto state S1 will have a value less than one. However, while this isgenerally true, not every frequency index corresponding to state S1 willhave a value of one. Thus, a sum of the normalized energies iscalculated for each state. In this manner, generally, the normalizedenergies corresponding to the frequency indices representing state S1will have a greater sum than energies corresponding to the frequencyindices representing other states. If the sum of normalized energiescorresponding to the frequency indices representing state S1 exceeds athreshold of 4.0 for detection, state S1 is determined to be the mostprobable symbol that was embedded in the encoded audio. If, however, thesum does not exceed the threshold, there is insufficient confidence thatstate S1 was encoded, and no state is determined to be the most probablestate. Thus, the output of the symbol determiner 2208 is a stream ofmost probable symbols that were encoded into the audio. Under idealconditions, the code frequencies of S1 will yield a normalized score of7.0

The most probable symbols are processed by the validity checker 2210 todetermine if the received symbols correspond to valid data. That is, thevalidity checker 2210 determines if bits corresponding to the mostprobable symbol are valid given the encoding scheme used to convert thecode into a symbol at the code frequency selector 1906 of the encoder1802. The output of the validity checker 2210 is the code, whichcorresponds to the code provided to the code frequency selector 1906 ofFIG. 19.

While an example manner of implementing the example decoder 1816 of FIG.18 has been illustrated in FIG. 22, one or more of the interfaces, datastructures, elements, processes and/or devices illustrated in FIG. 22may be combined, divided, re-arranged, omitted, eliminated and/orimplemented in any other way. Further, the example sampler 2202, theexample time to frequency domain converter 2204, the example codefrequency monitor 2206, the example symbol determiner 2208, the examplevalidity checker 2210 and/or, more generally, the example decoder 1816of FIG. 22 may be implemented by hardware, software, firmware and/or anycombination of hardware, software and/or firmware. Thus, for example,any of the example sampler 2202, the example time to frequency domainconverter 2204, the example code frequency monitor 2206, the examplesymbol determiner 2208, the example validity checker 2210 and/or, moregenerally, the example decoder 1816 may be implemented by one or morecircuit(s), programmable processor(s), ASIC(s), PLD(s), FPLD(s), and/orFPGA(s), etc. When any apparatus claim of this patent incorporating oneor more of these elements is read to cover a purely software and/orfirmware implementation, at least one of the example sampler 2202, theexample time to frequency domain converter 2204, the example codefrequency monitor 2206, the example symbol determiner 2208, the examplevalidity checker 2210 and/or, more generally, the example decoder 1816are hereby expressly defined to include a tangible article ofmanufacture such as a tangible computer-readable medium such as thosedescribed above in connection with FIG. 17 storing the firmware and/orsoftware. Further still, the example decoder 1816 may includeinterfaces, data structures, elements, processes and/or devices insteadof, or in addition to, those illustrated in FIG. 22 and/or may includemore than one of any or all of the illustrated interfaces, datastructures, elements, processes and/or devices.

FIG. 23 illustrates example machine-accessible instructions 2300 thatmay be executed to implement the example decoder 1816 of FIGS. 18 and22. A processor, a controller and/or any other suitable processingdevice may be used and/or programmed to execute the examplemachine-accessible instructions of FIG. 23. For example, themachine-accessible instructions of FIG. 23 may be embodied in codedinstructions stored on any combination of tangible article ofmanufacture such as a tangible computer-readable medium discussed abovein connection with FIG. 17. Machine-readable instructions comprise, forexample, instructions and data that cause a processor, a computer and/ora machine having a processor (e.g., the example processor platform P100discussed below in connection with FIG. 24) to perform one or moreparticular processes. Alternatively, some or all of the examplemachine-accessible instructions of FIG. 23 may be implemented using anycombination(s) of ASIC(s), PLD(s), FPLD(s), FPGA(s), discrete logic,hardware, firmware, etc. Also, some or all of the example process ofFIG. 23 may be implemented manually or as any combination of any of theforegoing techniques, for example, any combination of firmware,software, discrete logic and/or hardware. Further, many other methods ofimplementing the example operations of FIG. 23 may be employed. Forexample, the order of execution of the blocks may be changed, and/or oneor more of the blocks described may be changed, eliminated, sub-divided,or combined. Additionally, any or all of the example machine-accessibleinstructions of FIG. 23 may be carried out sequentially and/or carriedout in parallel by, for example, separate processing threads,processors, devices, discrete logic, circuits, etc.

The example process 2300 of FIG. 23 begins by sampling audio (block2302). The audio may be obtained via an audio sensor, a hardwiredconnection, via an audio file, or through any other suitable technique.As explained above the sampling may be carried out at 48,000 Hz, or anyother suitable frequency.

As each sample is obtained, a sliding time to frequency conversion isperformed on a collection of samples including numerous older samplesand the newly added sample obtained at block 2302 (block 2304). In someexamples, a sliding DFT is used to process streaming input samplesincluding 18,431 old samples and the one newly added sample. In someexamples, the DFT using 18,432 samples results in a spectrum having aresolution of 2.6 Hz.

After the spectrum is obtained through the time to frequency conversion(block 2304), the energies of the code frequencies are determined (block2306). In some examples, the energies may be obtained by taking themagnitude of the result of the time to frequency conversion (block 2304)for the frequency components that may be emphasized to encode the audio.To save processing time and minimize memory consumption, only frequencyinformation corresponding to the code frequencies may be retained andprocessed further, because those frequencies are the only frequencies atwhich encoded information may be located. Of course, the example process2300 may use other information than the energies. For example, theexample process 2300 could retain both magnitude and phase informationand process the same.

Additionally, the frequencies that are processed in the process 2300 maybe further reduced by considering a previously-received synchronizationsymbol. For example, if a particular synchronization symbol is alwaysfollowed by one of six different symbols, the frequencies that areprocessed may be reduced to those of the six different symbols afterthat particular synchronization symbol is received.

After the energies are determined (block 2306), the example process 2300normalizes the code frequency energies of each Code Block based on thelargest energy in that Code Block (block 2308). That is, the maximumenergy of a code frequency in a Code Block is used as a divisor againstitself and all other energies in that Code Block. The normalizationresults in each Code Block having one frequency component having anormalized energy value of one, with all other normalized energy valuesin that Code Block having values less than one. Thus, with reference toFIG. 20A, each row of the chart 2000 will have one entry having a valueof one and all other entries will have values less than one.

The example process 2300 then operates on the normalized energy valuesto determine the most likely symbol based thereon (block 2310). Asexplained above, this determination includes, for example, summing thenormalized energy values corresponding to each symbol, thereby resultingin the same number of sums as symbols (e.g., in consideration of thechart of FIG. 20A, there would be 144 sums, each of which corresponds toone of the 144 symbols). The largest sum is then compared to a threshold(e.g., 4.0) and if the sum exceeds the threshold, the symbolcorresponding to the largest sum is determined to be the receivedsymbol. If the largest sum does not exceed the threshold, no symbol isdetermined to be the received symbol.

After having determined the received symbol (block 2310), the exampleprocess 2300 determines the code corresponding to the received symbol(block 2312). That is, the example process 2300 decodes the encoding ofa code into a symbol that was carried out by the example encodingprocess 2100 (e.g., the encoding performed by block 2108).

After the decoding is complete and codes are determined from symbols(block 2312), the example process 2300 analyzes the code for validity(block 2314). For example, the received codes may be examined todetermine if the code sequence is valid based on the encoding process bywhich codes are sent. Valid codes are logged and may be sent back to acentral processing facility at a later time, along with a time and datestamp indicating when the codes were received. Additionally oralternatively, as described above in connection with FIGS. 1-17, thevalid codes may be used to obtain and present secondary content for theprimary media content associated with the decoded audio.

FIG. 24 is a schematic diagram of an example processor platform P100that may be used and/or programmed to implement any of the exampleapparatus disclosed herein. For example, one or more general-purposeprocessors, processor cores, microcontrollers, etc can implement theprocessor platform P100.

The processor platform P100 of the example of FIG. 24 includes at leastone programmable processor P105. The processor P105 executes codedinstructions P110 and/or P112 present in main memory of the processorP105 (e.g., within a RAM P115 and/or a ROM P120). The processor P105 maybe any type of processing unit, such as a processor core, a processorand/or a microcontroller. The processor P105 may execute, among otherthings, the example machine-accessible instructions of FIGS. 17, 21, 23,28, 29, 36, 37, 43, 45, 4-52 and 55, the example operations of FIGS.6-10, 30 and 31, the example flows of FIGS. 14-16, to deliver secondarycontent for primary media contents, to encode audio, and/or to decodeaudio as described herein.

The processor P105 is in communication with the main memory (including aROM P120 and/or the RAM P115) via a bus P125. The RAM P115 may beimplemented by dynamic random access memory (DRAM), synchronous dynamicrandom access memory (SDRAM), and/or any other type of RAM device, andROM may be implemented by flash memory and/or any other desired type ofmemory device. Access to the memory P115 and the memory P120 may becontrolled by a memory controller (not shown). The example memory P115may be used to, for example, implement the example media stores 130, 340and/or the example databases 1120, 1130 and 1135.

The processor platform P100 also includes an interface circuit P130. Anytype of interface standard, such as an external memory interface, serialport, general-purpose input/output, etc, may implement the interfacecircuit P130. One or more input devices P135 and one or more outputdevices P140 are connected to the interface circuit P130. The inputdevices P135 and the output devices P140 may be used to implement any ofthe example broadcast input interface 205, the example Bluetoothinterface 220, the example wireless interface 225, the examplecommunication interface 230, the example audio input interface 305, theexample display 330, the example input device(s) 335, the examplewireless interface 315, the example cellular interface 320 and/or theexample Bluetooth interface 345.

FIG. 25 illustrates an example manner of implementing the examplesecondary content module 170 of FIGS. 1 and 3. To fetch a schedule ofsecondary content, the example secondary content module 170 of FIG. 25includes a fetcher 2505. In response to a SID and a timestamp t(n)received from the example decoder 310 (FIG. 3) and/or from the examplemedia server 105 via, for example, the Bluetooth interface 345, theexample fetcher 2505 of FIG. 25 interacts with the example secondarycontent server 175 based on the SID and timestamp t(n) to obtain aschedule of secondary content. The example fetcher 2505 stores thereceived secondary content schedules in a schedule database 2510 in theexample media store 340. Example data structures that may be used by thesecondary content server 175 to provide the secondary content scheduleto the fetcher 2505 and/or by the fetcher 2505 to store the receivedsecondary content schedule in the schedule database 2510 are describedbelow in connection with FIGS. 26 and 27.

To identify a portion of and/or location within primary media content,the example secondary content module 170 of FIG. 25 includes a programclock 2515. When the example fetcher 2505 receives a timestamp t(n)during primary media content, the example program clock 2515 of FIG. 25is (re)set so that its time value substantially corresponds to thereceived timestamp t(n). Subsequently, the program clock 2515 can beused to identify later portions of and/or locations within the primarymedia content.

To select secondary content to be displayed, the example secondarycontent module 170 of FIG. 25 includes a selector 2520. The exampleselector 2520 of FIG. 25 compares time values provided by the programclock 2515 to timestamp values associated with each secondary contentitems in the secondary content schedule stored in the schedule database2510 to identify one or more secondary content offers to display via,for example, the example user interface of FIG. 4. As described below inconnection with FIGS. 26 and 27, each secondary content offer listed inthe schedule has an associated start timestamp and an associated endtimestamp. When the current time value generated by the program clock2515 falls within such a range, the example selector 2520 selects thecorresponding secondary content offer for display.

To archive secondary content and/or secondary content offers, theexample secondary content module 170 of FIG. 25 includes an archiver2525 and an archive 2530. As configured and/or operated by a person viathe example user interface module 325, the example archiver 2525 storesparticular secondary content and/or secondary content offers in theexample archive 2530 for subsequent retrieval. For example, the personmay configure that certain categories of secondary content and/orsecondary content offers be automatically archived and/or mayindividually select particular secondary content and/or secondarycontent offers for archival. For example, the person can indicate thatall recipe and cooking related secondary content offers be archived. Theperson can also interact with the archiver 2525 to query, search and/oridentify secondary content in the archive 2530 for presentation. Forexample, the person can search by type of secondary content, date, time,etc.

Example machine-accessible instructions that may be executed toimplement the example secondary content module 170 of FIG. 25 aredescribed below in connection with FIGS. 28 and 29.

While an example manner of implementing the example secondary contentmodule 170 of FIGS. 1 and 3 has been illustrated in FIG. 25, one or moreof the interfaces, data structures, elements, processes and/or devicesillustrated in FIG. 25 may be combined, divided, re-arranged, omitted,eliminated and/or implemented in any other way. Further, the examplefetcher 2505, the example program clock 2515, the example selector 2520,the example archiver 2525, the example schedule database 2510, theexample archive 2530 and/or, more generally, the example secondarycontent module 170 of FIG. 25 may be implemented by hardware, software,firmware and/or any combination of hardware, software and/or firmware.Thus, for example, any of the example fetcher 2505, the example programclock 2515, the example selector 2520, the example archiver 2525, theexample schedule database 2510, the example archive 2530 and/or, moregenerally, the example secondary content module 170 may be implementedby one or more circuit(s), programmable processor(s), ASIC(s), PLD(s),FPLD(s), and/or FPGA(s), etc. When any apparatus claim of this patentincorporating one or more of these elements is read to cover a purelysoftware and/or firmware implementation, at least one of the examplefetcher 2505, the example program clock 2515, the example selector 2520,the example archiver 2525, the example schedule database 2510, theexample archive 2530 and/or, more generally, the example secondarycontent module 170 are hereby expressly defined to include a tangiblearticle of manufacture such as a tangible computer-readable medium suchas those described above in connection with FIG. 17 storing the firmwareand/or software. Further still, the example secondary content module 170may include interfaces, data structures, elements, processes and/ordevices instead of, or in addition to, those illustrated in FIG. 25and/or may include more than one of any or all of the illustratedinterfaces, data structures, elements, processes and/or devices.

FIGS. 26 and 27 illustrate example data structures that may be used toimplement a secondary content schedule. The example data structures ofFIGS. 26 and 27 may be used by the example secondary content server 175to send a secondary content schedule to the example media server 105and/or the example secondary content presentation device 150, and/or tostore a secondary content schedule at any device of the example contentdelivery system 100 of FIG. 1.

The example data structure of FIG. 26 contains fields 2605 that identifyparticular primary media content, and includes a plurality of entries2610 for respective secondary content offers. To identify primary mediacontent, the example data structure of FIG. 26 includes a SID field2612. The example SID field 2612 of FIG. 26 contains a SID correspondingto particular primary media content. To represent a logo associated withthe identified primary media content, the example data structure of FIG.26 includes a SID logo field 2614. The example SID logo field 2614contains data representing a logo and/or contains one or more charactersidentifying a file and/or a link to the logo. To further identify theprimary media content, the example data structure of FIG. 26 includes aprogram name field 2616. The example program name field 2616 of FIG. 26contains one or more alphanumeric characters that represent the name ofthe identified primary media content and/or the name of a contentprovider 135 associated with the primary media content.

To identify a secondary content offer, each of the example entries 2610of FIG. 26 includes an offer ID field 2624. Each of the example offer IDfields 2624 of FIG. 26 contains one or more alphanumeric characters thatuniquely identify a secondary content offer. To further identify thesecondary content offer, each of the example entries 2610 of FIG. 26includes a name field 2626. Each of the example name fields 2626 of FIG.26 contains one or more alphanumeric characters representing a name ofthe identified secondary content offer.

To identify times within the primary media content identified in the SIDfield 2612 during which the secondary content offer is to be displayed,each of the example entries 2610 of FIG. 26 includes a begin field 2628and an end field 2630. Each of the example begin fields 2628 of FIG. 26contains a time corresponding to when the secondary content offer maybegin being presented. Each of the example end fields 2630 of FIG. 26contains a time corresponding to when the secondary content offer is nolonger to be presented.

To specify an offer type, each of the example entries 2610 of FIG. 26includes an offer type field 2632. Each of the example offer type fields2632 of FIG. 26 contains one or more alphanumeric characters thatrepresent a type of secondary content offer. Example secondary contentoffer types include, but are not limited to, related to primary mediacontent, related to product placement, related to a commercial, relatedto a user loyalty level, related to a user affinity group, etc.

To specify a banner to be displayed to present an offer (e.g., in theexample user interface of FIG. 4), each of the example entries 2610 ofFIG. 26 includes a banner field 2634 and a banner format field 2636.Each of the example banner fields 2634 of FIG. 26 contains datarepresenting a banner to be presented and/or contains one or morecharacters identifying a file and/or a link to the banner. Each of theexample banner type fields 2636 of FIG. 26 contains one or morealphanumeric characters representing a type of banner. Example bannertypes include, but are not limited to, bitmap, shockwave flash, flashvideo, portable network graphics, etc.

To identify an action type, each of the example entries 2610 of FIG. 26includes a type field 2638. Each of the example type fields 2638 of FIG.26 includes one or more numbers, letters and/or codes that identify atype of action 2640. Example action types include, but are not limitedto, web access, web link, local module ID, phone dialing, and/or passthrough to a local applet.

To specify an action, each of the example entries 2610 of FIG. 26includes an action field 2640. Each of the example action fields 2640 ofFIG. 26 includes text and/or command(s) that define an action and/orsecondary content corresponding to the identified offer. Example scriptsinclude, but are not limited to, a URL, a phone number, a target applet,and/or an OS command. When the corresponding secondary content offer isselected and/or activated, the action 2610 is activated and/or used toobtain the corresponding secondary content.

To identify content to be cached, each of the example entries 2610 ofFIG. 26 includes a content field 2642. Each of the example contentfields 2642 of FIG. 26 identifies, for example, a set of web pagesand/or other secondary content to be cached on the secondary contentpresentation device 150.

To categorize the secondary content, each of the example entries 2610 ofFIG. 26 includes a category field 2644 and a sub-category field 2646.Each of the example category fields 2644 and the sub-category fields2646 of FIG. 26 contain one or more alphanumeric characteristics usefulfor categorizing secondary content. Example categories include, but arenot limited to, news, cooking, sports, information, educational,infomercial, etc.

To define whether the secondary content and/or secondary content offermay be saved, each of the example entries 2610 of FIG. 26 includes anarchivable field 2648. Each of the example archivable fields 2648 ofFIG. 26 contains a value that represents whether the secondary contentand/or secondary content offer can be saved at the secondary contentpresentation device 150 and/or the media server 105 for subsequentretrieval and/or display at the secondary content presentation device150 and/or the media server 105. In some examples, the archivable field2648 defines a time period during which the action 1205 may be saved atthe secondary content presentation device 150 and/or the media server105 and/or a time at which the secondary content and/or secondarycontent offer is to be flushed from the cache.

To identify an expiration date and/or time, each of the example entries2610 of FIG. 26 includes an expiration field 2650. Each of the exampleexpiration fields 2650 of FIG. 26 includes a day and/or time at whichthe identified secondary content and/or secondary content offer expiresand, thus, no longer valid for presentation and/or retrieval.

FIG. 27 illustrates example secondary content schedule eXtensible MarkupLanguage (XML) document that represents and/or implements a secondarycontent schedule using a data structure similar to that described abovein connection with FIG. 26. Because identical elements are depicted inFIGS. 26 and 27, the descriptions of identical elements are not repeatedhere. Instead the interested reader is referred to the descriptionspresented above in connection with FIG. 26. An XML document (e.g., theexample XML document of FIG. 27) used to represent a secondary contentschedule may be constructed and/or generated according to and/or usinggrammar defined by a secondary content schedule XML schema. FIG. 58illustrates an example secondary content schedule XML schema thatdefines one or more constraints on the structure and/or content ofsecondary content schedule XML documents, beyond the conventionalsyntactical constraints imposed by XML. Example constraints areexpressed as one or more combinations of grammatical rules that governthe order of elements, one or more Boolean predicates that the contentmust satisfy, one or more data types that govern the content of elementsand attributes, and/or one or more specialized rules such as uniquenessand referential integrity constraints.

While example data structures that may be used to implement a secondarycontent schedule have been illustrated in FIGS. 26, 27 and 58, one ormore of the entries and/or fields may be combined, divided, re-arranged,omitted, eliminated and/or implemented in any other way. Moreover, theexample data structures of FIGS. 26, 27 and/or 58 may include fieldsinstead of, or in addition to, those illustrated in FIGS. 26, 27 and/or58, and/or may include more than one of any or all of the illustratedfields.

FIGS. 28 and 29 illustrate example machine-accessible instructions thatmay be executed to implement the example secondary content module 170 ofFIGS. 1, 3 and 25. A processor, a controller and/or any other suitableprocessing device may be used and/or programmed to execute the examplemachine-accessible instructions of FIGS. 28 and 29. For example, themachine-accessible instructions of FIGS. 28 and 29 may be embodied incoded instructions stored on any combination of tangible article ofmanufacture such as a tangible computer-readable medium discussed abovein connection with FIG. 17. Machine-readable instructions comprise, forexample, instructions and data that cause a processor, a computer and/ora machine having a processor (e.g., the example processor platform P100discussed above in connection with FIG. 24) to perform one or moreparticular processes. Alternatively, some or all of the examplemachine-accessible instructions of FIGS. 28 and 29 may be implementedusing any combination(s) of ASIC(s), PLD(s), FPLD(s), FPGA(s), discretelogic, hardware, firmware, etc. Also, some or all of the exampleprocesses of FIGS. 28 and 29 may be implemented manually or as anycombination of any of the foregoing techniques, for example, anycombination of firmware, software, discrete logic and/or hardware.Further, many other methods of implementing the example operations ofFIGS. 28 and 29 may be employed. For example, the order of execution ofthe blocks may be changed, and/or one or more of the blocks describedmay be changed, eliminated, sub-divided, or combined. Additionally, anyor all of the example machine-accessible instructions of FIGS. 28 and 29may be carried out sequentially and/or carried out in parallel by, forexample, separate processing threads, processors, devices, discretelogic, circuits, etc.

The example machine-accessible instructions of FIG. 28 begin when a userinitiates and/or starts an application on the secondary contentpresentation device 150 that implements the example secondary contentmodule 170 (block 2805). The secondary content module 170 starts and/orenables the decoder 310 (block 2810).

When the decoder 310 detects a valid code (e.g., a SID) 2812, theexample fetcher 2505 determines whether the SID has changed and/or isdifferent from a preceding S1 (block 2815). If the SID has changed(block 2815), the fetcher 2505 fetches a new secondary content schedulefrom the secondary content server 175 (block 2820), stores the receivedschedule in the schedule database 2510 (block 2825), and sets theprogram clock 2515 to correspond to the timestamp t(n) detected by thedecoder 310 (block 2830).

Returning to block 2815, if the SID has not changed (block 2815), thefetcher 2505 determines whether the current timestamp t(n) falls withinthe time interval defined and/or encompassed by the secondary contentschedule stored in the schedule database 2510 (block 2835). If thecurrent timestamp t(n) is falls within the secondary content schedule(block 2835), the selector 2520 determines whether the timestamp t(n)corresponds to an offer (e.g., secondary content) in the schedule (block2840). If the timestamp t(n) corresponds to a secondary content offer inthe schedule (block 2840), the selector 2520 obtains the correspondingsecondary content from the schedule 2510, and displays the correspondingsecondary content via the user interface module 325 (block 2845).

The example selector 2520 compares time values generated by the programclock 2515 to the begin times 2628 (FIG. 26) and the end times 2630 inthe schedule database 2510 to determine whether it is time to displayany secondary content offers (block 2850). If it is time to one or moredisplay secondary content offers (block 2850), the selector 2520 obtainsthe secondary content offer(s) from the schedule 2510 and displays thesecondary content offer(s) via the user interface module 325 (block2845).

If the user indicates via the user interface module 325 that an offerand/or secondary content is to be archived, and/or an offer is to beautomatically archived (e.g., based on archive settings) (block 2855),the archiver 2525 stores the secondary content offer(s) and/or secondarycontent in the archive 2530 (block 2860).

If the user indicates via the user interface module 325 that ansecondary content offer and/or secondary content is to be retrieved(e.g., by providing search query criteria), the archiver 2525 retrievesthe secondary content offer and/or secondary content from the archive2530 (block 2865), and the selector 2520 displays the retrievedsecondary content via the user interface module 325 (block 2845).

If the user indicates via the user interface module 325 that the archive2530 is to be edited and/or modified (e.g., items removed), the archiver2525 makes corresponding changes to the archive 2530 (block 2870).

Portions of the example machine-accessible instructions of FIG. 29 areidentical to those of FIG. 28. Identical portions of FIGS. 28 and 29 areidentified with identical reference numerals, and descriptions of theidentical portions is not repeated here. Instead, the reader is referredto the descriptions of the identical portions presented above inconnection with FIG. 28. Compared to FIG. 28, the decoding of timestampst(n) is not continually performed in the example machine-accessibleinstructions of FIG. 29.

At block 2815 (FIG. 29), if the SID has not changed (block 2815), thesecondary content module 170 activates timestamp decoding (block 2905).If a valid timestamp t(n) 2910 is decoded, the fetcher 2505 determineswhether the timestamp t(n) falls within the time interval defined and/orencompassed by the secondary content schedule stored in the scheduledatabase 2510 (block 2915). If the timestamp t(n) falls within theschedule (block 2915), the program timer 2510 determines whether thetimestamp t(n) matches an output of the program timer 2510 (block 2920).If the timestamp t(n) does not substantially correspond to the output ofthe program timer 2510 (block 2920), the program timer 2510 is reset tomatch the timestamp t(n) (block 2925).

Returning to block 2915, if the timestamp t(n) does not fall within thesecondary content schedule (block 2915), the fetcher 2505 fetches a newsecondary content schedule (block 2820).

Aperiodically and/or periodically, the fetcher 2505 determines whetherit is time to synchronize schedules (block 2930). If it is time tosynchronize schedules (block 2930), control proceeds to block 2905 todecode another timestamp t(n).

FIGS. 30 and 31 illustrates example schedule-based secondary contentdelivery scenarios that may be carried out by the example deliverysystem 100 of FIG. 1. While the examples illustrated in FIGS. 30 and 31are depicted in a serial fashion, as discussed above in connection withFIG. 17, the activities of detecting codes, detecting timestamps t(n),obtaining secondary content, obtaining links to secondary content,obtaining secondary content schedules, displaying secondary contentlinks, displaying secondary content offers, and displaying secondarycontent can occur substantially in parallel. Moreover, secondary contentmay be presented without providing and/or presenting an intervening linkand/or offer to that content. In some examples, variations of theexample scenarios of FIGS. 30 and 31 similar to those discussed above inconnection with FIGS. 7-11 are implemented.

The example secondary content delivery scenario of FIG. 30 begins withthe example secondary content server 175 setting and/or selecting adefault timeout interval T (block 3005), and sending a value 3010representative of the timeout T to the secondary content presentationdevice 150.

The example media server 105 receives primary media content 3015 via theexample broadcast input interface 205. The example media server 105and/or the example primary content presentation device 110 emits and/oroutputs the free-field radiating audio signal 172, 173 associated withthe primary media content 3015 via, for example, one or more speakers.

When the example decoder 310 of the secondary content presentationdevice 105 detects a SID in the audio 172, 173 (block 3020), the programclock 2515 synchronizes its output to the timestamp t(n) (block 3025).If the SID has changed (block 3030), the fetcher 2505 sends the SID andtimestamp t(n) to the secondary content server 175. The secondarycontent server 175 forms a schedule of secondary content based on theSID and timestamp t(n) (block 3035), and sends the secondary contentschedule to the fetcher 2505. The fetcher 2505 stores the secondarycontent schedule received from the secondary content server 175 in theschedule database 2510 (block 3040).

The example selector 2520 displays secondary content offers according tothe received secondary content schedule using, for example, the exampleuser interface of FIG. 4 (block 3045). As secondary content offers aredisplayed, the selector 2520 sends corresponding content IDs 3050 to theratings server 190. If any displayed link and/or offer is selectedand/or activated by a user (block 3055), a corresponding link ID 3060 issent to the ratings server 190 and the secondary content server 175. Inresponse to the link ID 3060, the secondary content server 175 providesto the secondary content presentation device 150 secondary content 3065associated with the link ID 3060. The secondary content presentationdevice 150 displays the received secondary content 3065 (block 3070). Ifthe collection of audience measurement data is not desired, theinteractions with the ratings server 190 may be omitted in theillustrated example of FIG. 30.

Returning to block 3030, if the SID has not changed (block 3030), thefetcher 2505 determines whether the new timestamp t(n) is greater than asum of the previous timestamp t(n−1) and the timeout interval T (block3075). If the new timestamp t(n) is greater than the sum (block 3075),the fetcher 2505 sends the SID and timestamp t(n) to the secondarycontent server 175 to request an updated secondary content schedule. Ifthe new timestamp t(n) is not greater than the sum (block 3075), controlproceeds to block 3045 to select and display secondary content.

FIG. 31 displays additional scenarios that may be carried out to selectand display secondary content. The additional scenarios of FIG. 31 maybe implemented in addition to and/or instead of the process of selectingand displaying secondary content illustrated in FIG. 30. The exampleoperations of FIG. 31 occur subsequent to launch, startup and/orinitiation of an application that implements the example secondarycontent module 170 (block 3105).

At some subsequent time (depicted by a dashed line 3107), and after asecondary content schedule has been received using, for example, theexample process of FIG. 30 up to and including block 3040, the exampleselector 2520 displays a secondary content offer (block 3110) and sendsa content ID 3115 corresponding to the offer to the rating server 190.

If automatic archiving is enabled for the category of offers includingthe displayed offer (block 3120), the archiver 2525 archives the offerin the archive 2530 (block 3125). If automatic archiving is notapplicable (block 3120), but the user has indicated that the offer is tobe archived (block 3130), the archiver 2525 archives the offer in thearchive 2530 (block 3125).

If any displayed link and/or secondary content offer is selected and/oractivated by a user (block 3140), a corresponding link ID 3145 is sentto the ratings server 190 and the secondary content server 175. Inresponse to the link ID 3145, the secondary content server 175 providesto the secondary content presentation device 150 secondary content 3150associated with the link ID 3060. The secondary content presentationdevice 150 displays the received secondary content 3150 (block 3155).

If at some subsequent time (depicted by a dashed line 3160), the userdesires to retrieve one or more archived secondary content offers (block3165), the archiver 2525 retrieves and/or sorts offers corresponding toone or more criteria provided by the user (block 3170). The exampleselector 2520 displays the retrieved and/or sorted secondary contentoffers (block 3175) and sends a content ID 3180 corresponding to theoffer to the rating server 190. If the collection of audiencemeasurement data is not desired, the interactions with the ratingsserver 190 may be omitted in the illustrated example of FIG. 31.

FIG. 32 illustrates an example manner of implementing the exampleloyalty-based scheduler 1160 of FIG. 11. To identify primary mediacontent, the example loyalty-based scheduler 1160 of FIG. 32 includes anidentifier 3205. Based on a SID and timestamp t(n) received from themedia server 105 and/or the secondary content presentation device 150,the example identifier 3205 queries a content provider and programdatabase 3210 to identify the corresponding primary media content.

To create user profiles, the example loyalty-based scheduler 1160 ofFIG. 32 includes a profile manager 3215. As primary media content isidentified by the example identifier 3205, the example profile manager3215 updates a user profile corresponding to a user ID (UID) receivedwith the SID and timestamp t(n). The user profile represents and/orstores which primary media content has been at least partially consumedby the user associated with the UID. The example profile manager 3215stores and/or maintains the user profile in a profile database 3220.

An example data structure that may be used to implement the exampleprofile database 3220 is illustrated in FIG. 33. The example datastructure of FIG. 33 is a table that records which of a plurality ofprimary media content 3305 have been consumed by each of a plurality ofusers 3310.

Returning to FIG. 32, to develop user loyalty and/or user affinity groupmetrics, the example loyalty-based scheduler 1160 of FIG. 32 includes aloyalty analyzer 3225. The example loyalty analyzer 3225 of FIG. 32analyzes a user's behavior to determine their level of loyalty toparticular primary media content and/or content providers 130.Additionally or alternatively, the loyalty analyzer 3225 analyzes agroup of user's behavior to determine and/or identify affinity groups,and to identify each group's likelihood of consuming particular primarymedia content, and/or responding to and/or consuming particularsecondary media content.

For a given loyalty metric (e.g., number of episodes of a TV show thatwere watched during a period of time), the example loyalty analyzer 3225segments the users of the secondary content server 175 into, forexample, three groups of equal size. An example group represents theusers who are most loyal and, thus, may be presented additional and/orspecial secondary content offers. In some examples, a user is onlycredited with consuming primary media content when a certain percentageof the primary media content has been consumed (e.g., watched and/orlistened to). In some examples, loyalty groups are defined in a loyaltydatabase 3230 and the loyalty analyzer 3225 compares a user's profilewith the defined loyalty groups to determine their level of loyalty.

In some examples, affinity groups (e.g., those who watch sports a lot,those who tend to watch a lot of movies, those who watch primarilyduring the day, etc.) can be identified and/or defined manually.Additionally or alternatively, data mining techniques can be applied tothe user profiles stored in the profile database 3220 to automaticallydefine affinity groups.

An example process that may be carried out to perform data mining todefine affinity groups can be illustrated with reference to the exampleuser profiles of FIG. 33. In the example of FIG. 33 there are threereality programs R1, R2 and R3, and three sports programs S1, S2 and S3.As shown, different users may watch different combinations of these sixprograms.

The example loyalty analyzer 3225 performs dimensional analysis todevelop indicators of a user's volume of media consumption, and theirpropensity and/or affinity to watch one type of program versus othertypes of programs. As shown in FIG. 34, the volume of a user's mediaconsumption can be expressed as a ratio PGMS of the number of showsconsumed by the user and the total number of possible shows. In theexample of FIG. 33, the propensity of the user to watch sports ratherthan reality shows can be expressed by the ratio S/(R+S), where S is thenumber of sports programs watched by the user and R is the number ofreality programs watched by the user. For example, user #1 watched allthree of the reality programs and none of sports programs, resulting inS/(R+S)=0/3 and PGMS=3/6.

The media consumption volume ratios PGMS and propensity ratios S/(R+S)can be used to identify and/or define clusters and/or affinity groups ofusers, as illustrated in FIG. 35. As shown in FIG. 35, the ten users areclustered into four example groups: Group A—watch reality programexclusively, Group B—watch sports exclusively, Group C—watch a varietyof programs in limited quantity, and Group D—watch a variety of programsin large quantity.

While the example process of defining groups described and illustratedin connection with FIGS. 33-35 has been simplified for ease ofdiscussion, it should be apparent to those of ordinary skill in the artthat the described example methods are readily extendible to include anynumber of users and/or any number of dimensions. It should also beapparent that affinity group clusters may change over time. Moreover,the affinity group(s) to which users belong may change over time. Insome examples, to minimize disruptions to advertisers due to affinitygroup changes, the example loyalty analyzer 3225 may apply one or morefilters to smooth the data used to define affinity groups, and/or torestrict how quickly affinity groups can change.

Returning to FIG. 32, loyalty and/or affinity group analysis may beperformed and/or updated each time a SID, UID and timestamp t(n) isreceived. Additionally or alternatively, it may run “offline” on aperiodic or aperiodic basis to reduce computing time, to take advantageof additional user profile information, and/or to reduce how long ittakes the loyalty-based scheduler 1160 to identify loyalty and/oraffinity based offers in response to a received SID, UID and t(n)combination.

To select secondary content offers for the received SID, UID andtimestamp t(n) combination, the example loyalty-based scheduler 1160 ofFIG. 32 includes an offer selector 3235. Based on the loyalty level(s)and/or affinity group membership(s) identified by the loyalty analyzer3225, the example offer selector 3235 queries an offer database 3240 toselect one or more secondary content offers. The secondary contentoffers selected by the offer selector 3235 may be in addition to orinstead of those selected by the action server 1140 based only on theUID and timestamp t(n).

To allow any number and/or type(s) of advertiser(s), program owner(s),content creator(s) and/or content provider(s) 3245 to define, specifyand/or provide secondary content offers for particular loyalty and/oraffinity groups, the example loyalty-based scheduler 1160 includes aloyalty/affinity manager 3250. The example loyalty/affinity manager 3250implements any number and/or type(s) of API(s) and/or web-basedinterface(s) that allow the advertiser(s), program owner(s), contentcreator(s) and/or content provider(s) 3245 to interact with the database3230 and 3240 to add, create, modify, remove and/or specify loyaltyand/or affinity based secondary content offers.

The example databases 3210, 3220, 3230 and 3240 of FIG. 32 may beimplemented using any number and/or type(s) of tangible article ofmanufacture such as a tangible computer-readable media including, butnot limited to, volatile and/or non-volatile memory(-ies) and/or memorydevice(s).

While an example manner of implementing the example loyalty-basedscheduler 1160 of FIG. 11 has been illustrated in FIG. 32, one or moreof the interfaces, data structures, elements, processes and/or devicesillustrated in FIG. 32 may be combined, divided, re-arranged, omitted,eliminated and/or implemented in any other way. Further, the exampleidentifier 3205, the example provider and program database 3210, theexample profile manager 3215, the example profile database 3220, theexample loyalty analyzer 3225, the example loyalty database 3230, theexample offer selector 3235, the example offers database 3240, theexample loyalty/affinity manager 3250 and/or, more generally, theexample loyalty-based scheduler 1160 of FIG. 32 may be implemented byhardware, software, firmware and/or any combination of hardware,software and/or firmware. Thus, for example, any of the exampleidentifier 3205, the example provider and program database 3210, theexample profile manager 3215, the example profile database 3220, theexample loyalty analyzer 3225, the example loyalty database 3230, theexample offer selector 3235, the example offers database 3240, theexample loyalty/affinity manager 3250 and/or, more generally, theexample loyalty-based scheduler 1160 may be implemented by one or morecircuit(s), programmable processor(s), ASIC(s), PLD(s), FPLD(s), and/orFPGA(s), etc. When any apparatus claim of this patent incorporating oneor more of these elements is read to cover a purely software and/orfirmware implementation, at least one of the example identifier 3205,the example provider and program database 3210, the example profilemanager 3215, the example profile database 3220, the example loyaltyanalyzer 3225, the example loyalty database 3230, the example offerselector 3235, the example offers database 3240, the exampleloyalty/affinity manager 3250 and/or, more generally, the exampleloyalty-based scheduler 1160 are hereby expressly defined to include atangible article of manufacture such as a tangible computer-readablemedium such as those described above in connection with FIG. 17 storingthe firmware and/or software. Further still, the example loyalty-basedscheduler 1160 may include interfaces, data structures, elements,processes and/or devices instead of, or in addition to, thoseillustrated in FIG. 32 and/or may include more than one of any or all ofthe illustrated interfaces, data structures, elements, processes and/ordevices.

FIGS. 36 and 37 illustrate example machine-accessible instructions thatmay be executed to implement the example loyalty-based scheduler 1160 ofFIGS. 11 and 32. A processor, a controller and/or any other suitableprocessing device may be used and/or programmed to execute the examplemachine-accessible instructions of FIGS. 36 and 37. For example, themachine-accessible instructions of FIGS. 36 and 37 may be embodied incoded instructions stored on any combination of tangible article ofmanufacture such as a tangible computer-readable medium discussed abovein connection with FIG. 17. Machine-readable instructions comprise, forexample, instructions and data that cause a processor, a computer and/ora machine having a processor (e.g., the example processor platform P100discussed above in connection with FIG. 24) to perform one or moreparticular processes. Alternatively, some or all of the examplemachine-accessible instructions of FIGS. 36 and 37 may be implementedusing any combination(s) of ASIC(s), PLD(s), FPLD(s), FPGA(s), discretelogic, hardware, firmware, etc. Also, some or all of the exampleprocesses of FIGS. 36 and 37 may be implemented manually or as anycombination of any of the foregoing techniques, for example, anycombination of firmware, software, discrete logic and/or hardware.Further, many other methods of implementing the example operations ofFIGS. 36 and 37 may be employed. For example, the order of execution ofthe blocks may be changed, and/or one or more of the blocks describedmay be changed, eliminated, sub-divided, or combined. Additionally, anyor all of the example machine-accessible instructions of FIGS. 36 and 37may be carried out sequentially and/or carried out in parallel by, forexample, separate processing threads, processors, devices, discretelogic, circuits, etc.

The example machine-accessible instructions of FIG. 36 begin when a SID,UID and timestamp t(n) 3605 are received. The example identifier 3205identifies the primary media content corresponding to the received SIDand timestamp t(n) 3605 (block 3610). The example profile manager 3215updates the user profile associated with the received UID 3605 in theprofile database 3220 (block 3615).

The loyalty analyzer 3225 computes and/or determines the user's loyaltyscore (e.g., number of times they have watched an episode of a TV show)(block 3620) and computes and/or determines the user's loyalty levelbased on the loyalty score (block 3625). In some examples, the loyaltyanalyzer 3225 automatically segments the user profiles into loyaltylevels (block 3630).

Based on the loyalty score determined by the loyalty analyzer 3225(block 3625), the offer selector 3235 queries the offers database 3240to determine whether there are any applicable loyalty-based secondarycontent offers (block 3635). If there is an applicable loyalty-basedsecondary content offer (block 3635), the offer selector 3235 adds theidentified offer(s) to the user's schedule 3645 (block 3640).

If a primary content owner and/or a content provider provide loyaltyinput(s) 3650 and 3655, respectively, the loyalty/affinity manager 3250updates the loyalty database 3230 (blocks 3660 and 3665, respectively).If the primary content owner and/or the content provider provideloyalty-based offer(s) 3650 and 3655, respectively, the loyalty/affinitymanager 3250 updates the offer database 3240 (blocks 3670).

The example machine-accessible instructions of FIG. 37 begin when a SID,UID and timestamp t(n) 3705 are received. The example identifier 3205identifies the primary media content corresponding to the received SIDand timestamp t(n) 3705 (block 3710). The example profile manager 3215updates the user profile associated with the received UID 3705 in theprofile database 3220 (block 3715).

The example loyalty analyzer 3225 compares the user's profile to one ormore affinity groups 3725 to determine whether the user belongs to anyaffinity groups (block 3730). The loyalty analyzer 3225 periodically oraperiodically analyzes the user profiles stored in the profile database3220 to define the one or more affinity groups 3725 (block 3735).

Based on the affinity group determination by the loyalty analyzer 3225(block 3730), the offer selector 3235 queries the offers database 3240to determine whether there are any applicable affinity group basedsecondary content offers (block 3740). If there is an applicableaffinity-based secondary content offer (block 3740), the offer selector3235 adds the identified offer(s) to the user's schedule 3750 (block3745).

If a user provides an affinity group based offer 3755, theloyalty/affinity manager 3250 updates the offers database 3240 (block3760).

An example encoding and decoding system 3800 is shown in FIG. 38. Theexample system 3800 may be, for example, a television audiencemeasurement system, which will serve as a context for furtherdescription of the encoding and decoding processes described herein. Theexample system 3800 includes an encoder 3802 that adds a code orinformation 3803 to an audio signal 3804 to produce an encoded audiosignal. The information 3803 may be any selected information. Forexample, in a media monitoring context, the information 3803 may berepresentative of and/or identify a broadcast media program such as atelevision broadcast, a radio broadcast, or the like. Additionally, theinformation 3803 may include timing information indicative of a time atwhich the information 3803 was inserted into audio or a media broadcasttime. Alternatively, the code may include control information that isused to control the behavior of one or more target devices. Furthermore,information 3803 from more than one source may be multiplexed andencoded into the audio 3804. For example, information 3803 provided by aTV network facility may be interleaved with information 3803 from, forexample, a local station. In some examples, TV network facilityinformation 3803 is encoded into each third message slot of the encodedaudio. Moreover, the audio 3804 may be received with the TV networkfacility information 3803 already encoded, and a subsequent encoder 3802can encode additional information 3803 using a remaining message slot(if any) of each 3 message slot interval. It should be understood thatthe example encoder 3802 of FIGS. 38 and 39 may be used to implement theexample content provider(s) 135 of FIG. 1 and/or the example actionencoder 1150 of FIG. 11.

The audio signal 3804 may be any form of audio including, for example,voice, music, noise, commercial advertisement audio, audio associatedwith a television program, live performance, etc. In the example of FIG.38, the encoder 3802 passes the encoded audio signal to a transmitter3806. The transmitter 3806 transmits the encoded audio signal along withany video signal 3808 associated with the encoded audio signal. While,in some instances, the encoded audio signal may have an associated videosignal 3808, the encoded audio signal need not have any associatedvideo.

Some example audio signals 3804 are a digitized version of an analogaudio signal, wherein the analog audio signal has been sampled at 48kHz. As described below in detail, two seconds of audio, whichcorrespond to 96,000 audio samples at the 48 kHz sampling rate, may beused to carry one message, which may be a synchronization message and 49bits of information. Using an encoding scheme of 7 bits per symbol, themessage requires transmission of eight symbols of information.Alternatively, in the context of overwriting described below, onesynchronization symbol is used and one information symbol conveying oneof 128 states follows the synchronization symbol. As described below indetail, according to one example, one 7-bit symbol of information isembedded in a long block of audio samples, which corresponds to 9216samples. Some such long blocks include 36 overlapping short blocks of256 samples, wherein in a 50% overlapping block 256 of the samples areold and 256 samples are new.

Although the transmit side of the example system 3800 shown in FIG. 38shows a single transmitter 3806, the transmit side may be much morecomplex and may include multiple levels in a distribution chain throughwhich the audio signal 3804 may be passed. For example, the audio signal3804 may be generated at a national network level and passed to a localnetwork level for local distribution. Accordingly, although the encoder3802 is shown in the transmit lineup prior to the transmitter 3806, oneor more encoders may be placed throughout the distribution chain of theaudio signal 3804. Thus, the audio signal 3804 may be encoded atmultiple levels and may include embedded codes associated with thosemultiple levels. Further details regarding encoding and example encodersare provided below.

The transmitter 3806 may include one or more of a radio frequency (RF)transmitter that may distribute the encoded audio signal through freespace propagation (e.g., via terrestrial or satellite communicationlinks) or a transmitter used to distribute the encoded audio signalthrough cable, fiber, etc. Some example transmitters 3806 are used tobroadcast the encoded audio signal throughout a broad geographical area.In other examples, the transmitter 3806 may distribute the encoded audiosignal through a limited geographical area. The transmission may includeup-conversion of the encoded audio signal to radio frequencies to enablepropagation of the same. Alternatively, the transmission may includedistributing the encoded audio signal in the form of digital bits orpackets of digital bits that may be transmitted over one or morenetworks, such as the Internet, wide area networks, or local areanetworks. Thus, the encoded audio signal may be carried by a carriersignal, by information packets or by any suitable technique todistribute the audio signals.

When the encoded audio signal is received by a receiver 3810, which, inthe media monitoring context, may be located at a statistically selectedmetering site 3812, the audio signal portion of the received programsignal is processed to recover the code, even though the presence ofthat code is imperceptible (or substantially imperceptible) to alistener when the encoded audio signal is presented by speakers 3814 ofthe receiver 3810. To this end, a decoder 3816 is connected eitherdirectly to an audio output 3818 available at the receiver 3810 or to amicrophone 3820 placed in the vicinity of the speakers 3814 throughwhich the audio is reproduced. The received audio signal can be eitherin a monaural or stereo format. Further details regarding decoding andexample decoders are provided below. It should be understood that theexample decoder 3816 and the example microphone 3820 of FIGS. 38 and 48may be used to implement the example decoder 310 and the example audioinput interface 305 of FIG. 3, respectively, and/or the examplesecondary content triggerer 180 of FIG. 1

Audio Encoding

As explained above, the encoder 3802 inserts one or more inaudible (orsubstantially inaudible) codes into the audio 3804 to create encodedaudio. One example encoder 3802 is shown in FIG. 39. In oneimplementation, the example encoder 3802 of FIG. 39 may be implementedusing, for example, a digital signal processor programmed withinstructions to implement an encoding lineup 3902, the operation ofwhich is affected by the operations of a prior code detector 3904 and amasking lineup 3906, either or both of which can be implemented using adigital signal processor programmed with instructions. Of course, anyother implementation of the example encoder 3802 is possible. Forexample, the encoder 3802 may be implemented using one or moreprocessors, programmable logic devices, or any suitable combination ofhardware, software, and firmware.

In general, during operation, the encoder 3802 receives the audio 3804and the prior code detector 3904 determines if the audio 3804 has beenpreviously encoded with information, which will make it difficult forthe encoder 3802 to encode additional information into the previouslyencoded audio. For example, a prior encoding may have been performed ata prior location in the audio distribution chain (e.g., at a nationalnetwork level). The prior code detector 3904 informs the encoding lineup3902 as to whether the audio has been previously encoded. The prior codedetector 3904 may be implemented by a decoder as described herein.

The encoding lineup 3902 receives the information 3803 and produces codefrequency signals based thereon and combines the code frequency signalwith the audio 3804. The operation of the encoding lineup 3902 isinfluenced by the output of the prior code detector 3904. For example,if the audio 3804 has been previously encoded and the prior codedetector 3904 informs the encoding lineup 3902 of this fact, theencoding lineup 3902 may select an alternate message that is to beencoded in the audio 3804 and may also alter the details by which thealternate message is encoded (e.g., different temporal location withinthe message, different frequencies used to represent symbols, etc.).

The encoding lineup 3902 is also influenced by the masking lineup 3906.In general, the masking lineup 3906 processes the audio 3804corresponding to the point in time at which the encoding lineup 3902wants to encode information and determines the amplitude at which theencoding should be performed. As described below, the masking lineup3906 may output a signal to control code frequency signal amplitudes tokeep the code frequency signal below the threshold of human perception.

As shown in the example of FIG. 39, the encoding lineup includes amessage generator 3910, a symbol selector 3912, a code frequencyselector 3914, a synthesizer 3916, an inverse Fourier transform 3918,and a combiner 3920. The message generator 3910 is responsive to theinformation 3803 and outputs messages having the format generally shownat reference numeral 3922. The information 3803 provided to the messagegenerator may be the current time, a television or radio stationidentification, a program identification, etc. Some example messagegenerators 3910 output a message every two seconds. Of course, othermessaging intervals such as 1.6 seconds are possible.

Some example message formats 3922 representative of messages output fromthe message generator 3910 include a synchronization symbol 3924. Thesynchronization symbol 3924 is used by decoders, examples of which aredescribed below, to obtain timing information indicative of the start ofa message. Thus, when a decoder receives the synchronization symbol3924, that decoder expects to see additional information following thesynchronization symbol 3924.

In the example message format 3922 of FIG. 39, the synchronizationsymbol 3924, is followed by 42 bits of message information 3926. Thisinformation may include a binary representation of a station identifierand coarse timing information. Some example timing informationrepresented in the 42 bits of message information 3926 change every 64seconds, or 32 message intervals. Thus, the 42 bits of messageinformation 3926 remain static for 64 seconds. The seven bits of messageinformation 3928 may be high resolution time that increments every twoseconds.

The message format 3922 also includes pre-existing code flag information3930. However, the pre-existing code flag information 3930 is onlyselectively used to convey information. When the prior code detector3904 informs the message generator 3910 that the audio 3804 has not beenpreviously encoded, the pre-existing code flag information 3930 is notused. Accordingly, the message output by the message generator onlyincludes the synchronization symbol 3924, the 42 bits of messageinformation 3926, and the seven bits of message information 3928; thepre-existing code flag information 3930 is blank or filled by unusedsymbol indications. In contrast, when the prior code detector 3904provides to the message generator 3910 an indication that the audio 3804into which the message information is to be encoded has previously beenencoded, the message generator 3910 will not output the synchronizationsymbol 3924, the 42 bits of message information 3926, or the seven bitsof message information 3928. Rather, the message generator 3910 willutilize only the pre-existing code flag information 3930. Some examplepre-existing code flags information include a pre-existing code flagsynchronization symbol to signal that pre-existing code flag informationis present. The pre-existing code flag synchronization symbol isdifferent from the synchronization symbol 3924 and, therefore, can beused to signal the start of pre-existing code flag information. Uponreceipt of the pre-existing code flag synchronization symbol, a decodercan ignore any prior-received information that aligned in time with asynchronization symbol 3924, 42 bits of message information 3926, orseven bits of message information 3928. To convey information, such as achannel indication, a distribution identification, or any other suitableinformation, a single pre-existing code flag information symbol followsthe pre-existing code flag synchronization symbol. This pre-existingcode flag information may be used to provide for proper crediting in anaudience monitoring system.

The output from the message generator 3910 is passed to the symbolselector 3912, which selects representative symbols. When thesynchronization symbol 3924 is output, the symbol selector may not needto perform any mapping because the synchronization symbol 3924 isalready in symbol format. Alternatively, if bits of information areoutput from the message generator 3910, the symbol selector may usestraight mapping, wherein, for example seven bits output from themessage generator 3910 are mapped to a symbol having the decimal valueof the seven bits. For example, if a value of 1010101 is output from themessage generator 3910, the symbol selector may map those bits to thesymbol 85. Of course other conversions between bits and symbols may beused. In certain examples, redundancy or error encoding may be used inthe selection of symbols to represent bits. Additionally, any othersuitable number of bits than seven may be selected to be converted intosymbols. The number of bits used to select the symbol may be determinedbased on the maximum symbol space available in the communication system.For example, if the communication system can only transmit one of foursymbols at a time, then only two bits from the message generator 3910would be converted into symbols at a time.

Another example message includes 8 long blocks followed by several nullshort blocks to pad the duration of the message to approximately 1.6seconds. The first of the 8 long blocks represents the synchronizationsymbol followed by 7 long blocks representing, for example, the payloador message content depicted in FIG. 57. The example message format ofFIG. 57 may be used to represent and/or encode 7*7=49 bits of data.

The symbols from the symbol selector 3912 are passed to the codefrequency selector 3914 that selects code frequencies that are used torepresent the symbol. The symbol selector 3912 may include one or morelook up tables (LUTs) 3932 that may be used to map the symbols into codefrequencies that represent the symbols. That is, a symbol is representedby a plurality of code frequencies that the encoder 3802 emphasizes inthe audio to form encoded audio that is transmitted. Upon receipt of theencoded audio, a decoder detects the presence of the emphasized codefrequencies and decodes the pattern of emphasized code frequencies intothe transmitted symbol. Thus, the same LUT selected at the encoder 3910for selecting the code frequencies needs to be used in the decoder. Anexample LUT is described in conjunction with FIGS. 40-42. Additionally,example techniques for generating LUTs are provided in conjunction withFIGS. 44-46.

The code frequency selector 3914 may select any number of different LUTsdepending of various criteria. For example, a particular LUT or set ofLUTs may be used by the code frequency selector 3914 in response to theprior receipt of a particular synchronization symbol. Additionally, ifthe prior code detector 3904 indicates that a message was previouslyencoded into the audio 3804, the code frequency selector 3914 may selecta lookup table that is unique to pre-existing code situations to avoidconfusion between frequencies used to previously encode the audio 3804and the frequencies used to include the pre-existing code flaginformation.

An indication of the code frequencies that are selected to represent aparticular symbol is provided to the synthesizer 3916. The synthesizer3916 may store, for each short block constituting a long block, threecomplex Fourier coefficients representative of each of the possible codefrequencies that the code frequency selector 3914 will indicate. Thesecoefficients represent the transform of a windowed sinusoidal codefrequency signal whose phase angle corresponds to the starting phaseangle of code sinusoid in that short block.

While the foregoing describes an example code synthesizer 3908 thatgenerates sine waves or data representing sine waves, other exampleimplementations of code synthesizers are possible. For example, ratherthan generating sine waves, another example code synthesizer 3908 mayoutput Fourier coefficients in the frequency domain that are used toadjust amplitudes of certain frequencies of audio provided to thecombiner 3920. In this manner, the spectrum of the audio may be adjustedto include the requisite sine waves.

The three complex amplitude-adjusted Fourier coefficients correspondingto the symbol to be transmitted are provided from the synthesizer 3916to the inverse Fourier transform 3918, which converts the coefficientsinto time-domain signals having the prescribed frequencies andamplitudes to allow their insertion into the audio to convey the desiredsymbols are coupled to the combiner 3920. The combiner 3920 alsoreceives the audio. In particular, the combiner 3920 inserts the signalsfrom the inverse Fourier transform 3918 into one long block of audiosamples. As described above, for a given sampling rate of 48 kHz, a longblock is 9216 audio samples. In the provided example, thesynchronization symbol and 49 bits of information require a total ofeight long blocks. Because each long block is 9216 audio samples, only73,728 samples of audio 3804 are needed to encode a given message.However, because messages begin every two seconds, which is every 96,000audio samples, there will be many samples at the end of the 96,000 audiosamples that are not encoded. The combining can be done in the digitaldomain, or in the analog domain.

However, in the case of a pre-existing code flag, the pre-existing codeflag is inserted into the audio 3804 after the last symbol representingthe previously inserted seven bits of message information. Accordingly,insertion of the pre-existing code flag information begins at sample73,729 and runs for two long blocks, or 18,432 samples. Accordingly,when pre-existing code flag information is used, fewer of the 96,000audio samples 3804 will be unencoded.

The masking lineup 3906 includes an overlapping short block maker thatmakes short blocks of 512 audio samples, wherein 256 of the samples areold and 256 samples are new. That is, the overlapping short block maker3940 makes blocks of 512 samples, wherein 256 samples are shifted intoor out of the buffer at one time. For example, when a first set of 256samples enters the buffer, the oldest 256 samples are shifted out of thebuffer. On a subsequent iteration, the first set of 256 samples areshifted to a latter position of the buffer and 256 samples are shiftedinto the buffer. Each time a new short block is made by shifting in 256new samples and removing the 256 oldest samples, the new short block isprovided to a masking evaluator 3942. The 512 sample block output fromthe overlapping short block maker 3940 is multiplied by a suitablewindow function such that an “overlap-and-add” operation will restorethe audio samples to their correct value at the output. A synthesizedcode signal to be added to an audio signal is also similarly windowed toprevent abrupt transitions at block edges when there is a change in codeamplitude from one 512-sample block to the next overlapped 512-sampleblock. These transitions if present create audible artifacts.

The masking evaluator 3942 receives samples of the overlapping shortblock (e.g., 512 samples) and determines an ability of the same to hidecode frequencies to human hearing. That is, the masking evaluatordetermines if code frequencies can be hidden within the audiorepresented by the short block by evaluating each critical band of theaudio as a whole to determine its energy and determining the noise-likeor tonal-like attributes of each critical band and determining the sumtotal ability of the critical bands to mask the code frequencies.According to the illustrated example, the bandwidth of the criticalbands increases with frequency. If the masking evaluator 3942 determinesthat code frequencies can be hidden in the audio 3804, the maskingevaluator 3904 indicates the amplitude levels at which the codefrequencies can be inserted within the audio 3804, while still remaininghidden and provides the amplitude information to the synthesizer 3916.

Some example the masking evaluators 3942 conduct the masking evaluationby determining a maximum change in energy E_(b) or a masking energylevel that can occur at any critical frequency band without making thechange perceptible to a listener. The masking evaluation carried out bythe masking evaluator 3942 may be carried out as outlined in the MovingPictures Experts Group—Advanced Audio Encoding (MPEG-AAC) audiocompression standard ISO/IEC 13818-7:1997, for example. The acousticenergy in each critical band influences the masking energy of itsneighbors and algorithms for computing the masking effect are describedin the standards document such as ISO/IEC 13818-7:1997. These analysesmay be used to determine for each short block the masking contributiondue to tonality (e.g., how much the audio being evaluated is like atone) as well as noise like (i.e., how much the audio being evaluated islike noise) features. Further analysis can evaluate temporal maskingthat extends masking ability of the audio over short time, typically,for 50-100 milliseconds (ms). The resulting analysis by the maskingevaluator 3942 provides a determination, on a per critical band basis,the amplitude of a code frequency that can be added to the audio 3804without producing any noticeable audio degradation (e.g., without beingaudible).

Because a 256 sample block will appear in both the beginning of oneshort block and the end of the next short block and, thus, will beevaluated two times by the masking evaluator 3942, the masking evaluatormakes two masking evaluations including the 256 sample block. Theamplitude indication provided to the synthesizer 3916 is a composite ofthose two evaluations including that 256 sample block and the amplitudeindication is timed such that the amplitude of the code inserted intothe 256 samples is timed with those samples arriving at the combiner3920.

Referring now to FIGS. 40-42, an example LUT 3932 is shown that includesone column representing symbols 4002 and seven columns 4004, 4006, 4008,4010, 4012, 4014, 4016 representing numbered code frequency indices. Theexample LUT 3932 of FIGS. 40-42 includes 129 rows, 128 of which are usedto represent data symbols and one of which is used to represent asynchronization symbol. Because the example LUT 3932 includes 128different data symbols, data may be sent at a rate of seven bits persymbol. The frequency indices in the table may range from 180-656 andare based on a long block size of 9216 samples and a sampling rate of 48kHz. Accordingly, the frequencies corresponding to these indices rangebetween 937.5 Hz and 3126.6 Hz, which falls into the humanly audiblerange. A description of a process to generate a LUT, such as the exampletable 3932 of FIGS. 40-42 is provided in conjunction with FIGS. 44-47.

While an example LUT 3932 is shown in FIGS. 40-42, other sampling ratesand frequency indices may be used to represent symbols. For example,frequency indices may be selected from a range representing 937.5 Hz to5010.4 Hz, which falls in the humanly audible range. For example, one ormore ranges of frequency indices may not be selected and/or not used toavoid interfering with frequencies used to carry other codes and/orwatermarks. Moreover, the selected and/or used ranges of frequenciesneed not be contiguous. In some examples, frequencies in the ranges 0.8kHz to 1.03 kHz and 2.9 kHz to 4.6 kHz are used. In other examples,frequencies in the ranges 0.75 kHz to 1.03 kHz and 2.9 kHz to 4.4 kHzare used.

In some example operations of the code frequency selector 3914, a symbolof 25 (e.g., a binary value of 0011001) is received from the symbolselector 3912. The code frequency selector 3914 accesses the LUT 3932and reads row 25 of the symbol column 4002. From this row, the codefrequency selector reads that code frequency indices 217, 288, 325, 403,512, 548, and 655 are to be emphasized in the audio 3804 to communicatethe symbol 25 to the decoder. The code frequency selector 3914 thenprovides an indication of these indices to the synthesizer 3916, whichsynthesizes the code signals by outputting Fourier coefficientscorresponding to these indices.

The combiner 3920 receives both the output of the code synthesizer 3908and the audio 3804 and combines them to form encoded audio. The combiner3920 may combine the output of the code synthesizer 3908 and the audio3804 in an analog or digital form. If the combiner 3920 performs adigital combination, the output of the code synthesizer 3908 may becombined with the output of the sampler 3902, rather than the audio 3804that is input to the sampler 3902. For example, the audio block indigital form may be combined with the sine waves in digital form.Alternatively, the combination may be carried out in the frequencydomain, wherein frequency coefficients of the audio are adjusted inaccordance with frequency coefficients representing the sine waves. As afurther alternative, the sine waves and the audio may be combined inanalog form. The encoded audio may be output from the combiner 3920 inanalog or digital form. If the output of the combiner 3920 is digital,it may be subsequently converted to analog form before being coupled tothe transmitter 3806.

While an example manner of implementing the example encoder 3802 of FIG.38 has been illustrated in FIG. 39, one or more of the interfaces, datastructures, elements, processes and/or devices illustrated in FIG. 39may be combined, divided, re-arranged, omitted, eliminated and/orimplemented in any other way. Further, the example message generator3910, the example symbol selector 3912, the example code frequencyselector 3914, the example code signal synthesizer 3916, the exampleinverse Fourier transform 3918, the example combiner 3920, the exampleprior code detector 3904, the example overlapping short block maker3940, the example masking evaluator 3942 and/or, more generally, theexample encoder 3802 of FIG. 39 may be implemented by hardware,software, firmware and/or any combination of hardware, software and/orfirmware. Thus, for example, any of the example message generator 3910,the example symbol selector 3912, the example code frequency selector3914, the example code signal synthesizer 3916, the example inverseFourier transform 3918, the example combiner 3920, the example priorcode detector 3904, the example overlapping short block maker 3940, theexample masking evaluator 3942 and/or, more generally, the exampleencoder 3802 may be implemented by one or more circuit(s), programmableprocessor(s), ASIC(s), PLD(s), FPLD(s), and/or FPGA(s), etc. When anyapparatus claim of this patent incorporating one or more of theseelements is read to cover a purely software and/or firmwareimplementation, at least one of the example message generator 3910, theexample symbol selector 3912, the example code frequency selector 3914,the example code signal synthesizer 3916, the example inverse Fouriertransform 3918, the example combiner 3920, the example prior codedetector 3904, the example overlapping short block maker 3940, theexample masking evaluator 3942 and/or, more generally, the exampleencoder 3802 are hereby expressly defined to include a tangible articleof manufacture such as a tangible computer-readable medium such as thosedescribed above in connection with FIG. 17 storing the firmware and/orsoftware. Further still, the example encoder 3802 may includeinterfaces, data structures, elements, processes and/or devices insteadof, or in addition to, those illustrated in FIG. 39 and/or may includemore than one of any or all of the illustrated interfaces, datastructures, elements, processes and/or devices.

FIG. 43 illustrates example machine-accessible instructions that may beexecuted to implement the example encoder 3802 of FIGS. 38 and 39. Aprocessor, a controller and/or any other suitable processing device maybe used and/or programmed to execute the example machine-accessibleinstructions of FIG. 43. For example, the machine-accessibleinstructions of FIG. 43 may be embodied in coded instructions stored onany combination of tangible article of manufacture such as a tangiblecomputer-readable medium discussed above in connection with FIG. 17.Machine-readable instructions comprise, for example, instructions anddata that cause a processor, a computer and/or a machine having aprocessor (e.g., the example processor platform P100 discussed above inconnection with FIG. 24) to perform one or more particular processes.Alternatively, some or all of the example machine-accessibleinstructions of FIG. 43 may be implemented using any combination(s) ofASIC(s), PLD(s), FPLD(s), FPGA(s), discrete logic, hardware, firmware,etc. Also, some or all of the example processes of FIG. 43 may beimplemented manually or as any combination of any of the foregoingtechniques, for example, any combination of firmware, software, discretelogic and/or hardware. Further, many other methods of implementing theexample operations of FIG. 43 may be employed. For example, the order ofexecution of the blocks may be changed, and/or one or more of the blocksdescribed may be changed, eliminated, sub-divided, or combined.Additionally, any or all of the example machine-accessible instructionsof FIG. 43 may be carried out sequentially and/or carried out inparallel by, for example, separate processing threads, processors,devices, discrete logic, circuits, etc.

The example process 4300 of FIG. 43 begins when audio samples to beencoded are received (block 4302). The process 4300 then determines ifthe received samples have been previously encoded (block 4304). Thisdetermination may be carried out, for example, by the prior codedetector 3904 of FIG. 39, or by any suitable decoder configured toexamine the audio to be encoded for evidence of a prior encoding.

If the received samples have not been previously encoded (block 4304),the process 4300 generates a communication message (block 4306), such asa communication message having the format shown in FIG. 39 at referencenumeral 3922. In one particular example, when the audio has not beenpreviously encoded, the communication message may include asynchronization portion and one or more portions including data bits.The communication message generation may be carried out, for example, bythe message generator 3910 of FIG. 39.

The communication message is then mapped into symbols (block 4308). Forexample, the synchronization information need not be mapped into asymbol if the synchronization information is already a symbol. Inanother example, if a portion of the communication message is a seriesof bits, such bits or groups of bits may be represented by one symbol.As described above in conjunction with the symbol selector 3912, whichis one manner in which the mapping (block 4308) may be carried out, oneor more tables or encoding schemes may be used to convert bits intosymbols. For example, some techniques may include the use of errorcorrection coding, or the like, to increase message robustness throughthe use of coding gain. In one particular example implementation havinga symbol space sized to accommodate 128 data symbols, seven bits may beconverted into one symbol. Of course, other numbers of bits may beprocessed depending on many factors including available symbol space,error correction encoding, etc.

After the communication symbols have been selected (block 4308), theprocess 4300 selects a LUT that will be used to determine the codefrequencies that will be used to represent each symbol (block 4310). Insome examples, the selected LUT may be the example LUT 3932 of FIGS.40-42, or may be any other suitable LUT. Additionally, the LUT may beany LUT generated as described in conjunction with FIGS. 44-46. Theselection of the LUT may be based on a number of factors including thesynchronization symbol that is selected during the generation of thecommunication message (block 4306).

After the symbols have been generated (block 4308) and the LUT isselected (block 4310), the symbols are mapped into code frequenciesusing the selected LUT (block 4312). In some examples in which the LUT3932 of FIG. 40-42 is selected, a symbol of, for example, 35 would bemapped to the frequency indices 218, 245, 360, 438, 476, 541, and 651.The data space in the LUT is between symbol 0 and symbol 127 and symbol128, which uses a unique set of code frequencies that do not match anyother code frequencies in the table, is used to indicate asynchronization symbol. The LUT selection (block 4310) and the mapping(block 4312) may be carried out by, for example, the code frequencyselector 3914 of FIG. 39. After the code frequencies are selected, anindication of the same is provided to, for example, the synthesizer 3916of FIG. 39.

Code signals including the code frequencies are then synthesized (block4314) at amplitudes according to a masking evaluation, which isdescribed in conjunction with blocks 3940 and 3942 or FIG. 39, and isdescribed in conjunction with the process 4300 below. In some examples,the synthesis of the code frequency signals may be carried out byproviding appropriately scaled Fourier coefficients to an inverseFourier process. For instance, three Fourier coefficients may be outputto represent each code frequency in the code frequency signals.Accordingly, the code frequencies may be synthesized by the inverseFourier process in a manner in which the synthesized frequencies arewindowed to prevent spill over into other portions of the signal intowhich the code frequency signals are being embedded. An exampleconfiguration that may be used to carry out the synthesis of block 4314is shown at blocks 3916 and 3918 of FIG. 39. Of course otherimplementations and configurations are possible.

After the code signals including the code frequencies have beensynthesized, they are combined with the audio samples (block 4316). Asdescribed in conjunction with FIG. 39, the combination of the codesignals and the audio is such that one symbol is inserted into each longblock of audio samples. Accordingly, to communicate one synchronizationsymbol and 49 data bits, information is encoded into eight long blocksof audio information: one long block for the synchronization symbol andone long block for each seven bits of data (assuming seven bits/symbolencoding). The messages are inserted into the audio at two secondintervals. Thus, the eight long blocks of audio immediately followingthe start of a message may be encoded with audio and the remaining longblocks that make up the balance of the two second of audio may beunencoded.

The insertion of the code signal into the audio may be carried out byadding samples of the code signal to samples of the host audio signal,wherein such addition is done in the analog domain or in the digitaldomain. Alternatively, with proper frequency alignment and registration,frequency components of the audio signal may be adjusted in thefrequency domain and the adjusted spectrum converted back into the timedomain.

The foregoing described the operation of the process 4300 when theprocess determined that the received audio samples have not beenpreviously encoded (block 4304). However, in situations in which aportion of media has been through a distribution chain and encoded as itwas processed, the received samples of audio processed at block 4304already include codes. For example, a local television station using acourtesy news clip from CNN in a local news broadcast might not getviewing credit based on the prior encoding of the CNN clip. As such,additional information is added to the local news broadcast in the formof pre-existing code flag information. If the received samples of audiohave been previously encoded (block 4304), the process generatespre-existing code flag information (block 4318). The pre-existing codeflag information may include the generation of an pre-existing code flagsynchronization symbol and, for example, the generation of seven bits ofdata, which will be represented by a single data symbol. The data symbolmay represent a station identification, a time, or any other suitableinformation. For example, a media monitoring site (MMS) may beprogrammed to detect the pre-existing code flag information to creditthe station identified therein.

After the pre-existing code flag information has been generated (block4318), the process 4300 selects the pre-existing code flag LUT that willbe used to identify code frequencies representative of the pre-existingcode flag information (block 4320). In some examples, the pre-existingcode flag LUT may be different than other LUTs used in non-pre-existingcode conditions. For instance, the pre-existing code flagsynchronization symbol may be represented by the code frequencies 220,292, 364, 436, 508, 580, and 652.

After the pre-existing code flag information is generated (block 4318)and the pre-existing code flag LUT is selected (block 4320), thepre-existing code flag symbols are mapped to code frequencies (block4312), and the remainder of the processing follows as previouslydescribed.

Sometime before the code signal is synthesized (block 4314), the process4300 conducts a masking evaluation to determine the amplitude at whichthe code signal should be generated so that it still remains inaudibleor substantially inaudible to human hearers. Accordingly, the process4300 generates overlapping short blocks of audio samples, eachcontaining 512 audio samples (block 4322). As described above, theoverlapping short blocks include 50% old samples and 50% newly receivedsamples. This operation may be carried out by, for example, theoverlapping short block maker 3940 of FIG. 39.

After the overlapping short blocks are generated (block 4322), maskingevaluations are performed on the short blocks (block 4324). For example,this may be carried out as described in conjunction with block 3942 ofFIG. 39. The results of the masking evaluation are used by the process4300 at block 4314 to determine the amplitude of the code signal to besynthesized. The overlapping short block methodology may yield twomasking evaluation for a particular 256 samples of audio (one when the256 samples are the “new samples,” and one when the 256 samples are the“old samples”), the result provided to block 4314 of the process 4300may be a composite of these masking evaluations. Of course, the timingof the process 4300 is such that the masking evaluations for aparticular block of audio are used to determine code amplitudes for thatblock of audio.

Lookup Table Generation

A system 4400 for populating one or more LUTs with code frequenciescorresponding to symbols may be implemented using hardware, software,combinations of hardware and software, firmware, or the like. The system4400 of FIG. 44 may be used to generate any number of LUTs, such as theLUT of FIGS. 40-42. The system 4400 which operates as described below inconjunction with FIG. 44 and FIG. 45, results in a code frequency indexLUT, wherein: (1) two symbols of the table are represented by no morethan one common frequency index, (2) not more than one of the frequencyindices representing a symbol reside in one audio critical band asdefined by the MPEG-AA compression standard ISO/IEC 13818-7:1997, and(3) code frequencies of neighboring critical bands are not used torepresent a single symbol. Criteria number 3 helps to ensure that audioquality is not compromised during the audio encoding process.

A critical band pair definer 4402 defines a number (P) of critical bandpairs. For example, referring to FIG. 46, a table 4600 includes columnsrepresenting AAC critical band indices 4602, short block indices 4604 inthe range of the AAC indices, and long block indices 4606 in the rangeof the AAC indices. In some examples, the value of P may be seven and,thus, seven critical band pairs are formed from the AAC indices (block4502). FIG. 47 shows the frequency relationship between the AAC indices.According to an example, as shown at reference numeral 4702 in FIG. 47wherein frequencies of critical band pairs are shown as separated bydotted lines, AAC indices may be selected into pairs as follows: fiveand six, seven and eight, nine and ten, eleven and twelve, thirteen andfourteen, fifteen and sixteen, and seventeen and seventeen. The AACindex of seventeen includes a wide range of frequencies and, therefore,index 17 is shown twice, once for the low portion and once for the highportion.

A frequency definer 4404 defines a number of frequencies (N) that areselected for use in each critical band pair. In some examples, the valueof N is sixteen, meaning that there are sixteen data positions in thecombination of the critical bands that form each critical band pair.Reference numeral 4704 in FIG. 47 identifies the seventeen frequencypositions are shown. The circled position four is reserved forsynchronization information and, therefore, is not used for data.

A number generator 4406 defines a number of frequency positions in thecritical band pairs defined by the critical band pair definer 4402. Insome examples the number generator 4406 generates all N^(P), P-digitnumbers. For example, if N is 16 and P is 7, the process generates thenumbers 0 through 268435456, but may do so in base 16—hexadecimal, whichwould result in the values 0 through 10000000.

A redundancy reducer 4408 then eliminates all number from the generatedlist of numbers sharing more than one common digit between them in thesame position. This ensures compliance with criteria (1) above because,as described below, the digits will be representative of the frequenciesselected to represent symbols. An excess reducer 4410 may then furtherreduce the remaining numbers from the generated list of numbers to thenumber of needed symbols. For example, if the symbol space is 129symbols, the remaining numbers are reduced to a count of 129. Thereduction may be carried out at random, or by selecting remainingnumbers with the greatest Euclidean distance, or my any other suitabledata reduction technique. In another example, the reduction may becarried out in a pseudorandom manner.

After the foregoing reductions, the count of the list of numbers isequal to the number of symbols in the symbol space. Accordingly, a codefrequency definer 4412 defines the remaining numbers in base P format torepresent frequency indices representative of symbols in the criticalband pairs. For example, referring to FIG. 47, the hexadecimal numberF1E4B0F is in base 16, which matches P. The first digit of thehexadecimal number maps to a frequency component in the first criticalband pair, the second digit to the second critical band pair, and so on.Each digit represents the frequency index that will be used to representthe symbol corresponding to the hexadecimal number F1E4B0F.

Using the first hexadecimal number as an example of mapping to aparticular frequency index, the decimal value of Fh is 15. Becauseposition four of each critical band pair is reserved for non-datainformation, the value of any hexadecimal digit greater than four isincremented by the value of one decimal. Thus, the 15 becomes a 16. The16 is thus designated (as shown with the asterisk in FIG. 47) as beingthe code frequency component in the first critical band pair torepresent the symbol corresponding to the hexadecimal number F1E4B0F.Though not shown in FIG. 47, the index 1 position (e.g., the secondposition from the far left in the critical band 7 would be used torepresent the hexadecimal number F1E4B0F.

A LUT filler 4414 receives the symbol indications and corresponding codefrequency component indications from the code frequency definer 4412 andfills this information into a LUT.

While an example manner of implementing a LUT table generator 4400 isillustrated in FIG. 44, one or more of the interfaces, data structures,elements, processes and/or devices illustrated in FIG. 44 may becombined, divided, re-arranged, omitted, eliminated and/or implementedin any other way. Further, the example critical band pair definer 4402,the example frequency definer 4404, the example number generator 4406,the example redundancy reducer 4408, the example excess reducer 4410,the example code frequency definer 4412, the example LUT filler 4414and/or, more generally, the example system 4400 of FIG. 44 may beimplemented by hardware, software, firmware and/or any combination ofhardware, software and/or firmware. Thus, for example, any of theexample critical band pair definer 4402, the example frequency definer4404, the example number generator 4406, the example redundancy reducer4408, the example excess reducer 4410, the example code frequencydefiner 4412, the example LUT filler 4414 and/or, more generally, theexample system 4400 may be implemented by one or more circuit(s),programmable processor(s), ASIC(s), PLD(s), FPLD(s), and/or FPGA(s),etc. When any apparatus claim of this patent incorporating one or moreof these elements is read to cover a purely software and/or firmwareimplementation, at least one of the example critical band pair definer4402, the example frequency definer 4404, the example number generator4406, the example redundancy reducer 4408, the example excess reducer4410, the example code frequency definer 4412, the example LUT filler4414 and/or, more generally, the example system 4400 are herebyexpressly defined to include a tangible article of manufacture such as atangible computer-readable medium such as those described above inconnection with FIG. 17 storing the firmware and/or software. Furtherstill, the example system 4400 may include interfaces, data structures,elements, processes and/or devices instead of, or in addition to, thoseillustrated in FIG. 44 and/or may include more than one of any or all ofthe illustrated interfaces, data structures, elements, processes and/ordevices.

FIG. 45 illustrates example machine-accessible instructions that may beexecuted to implement the example system 4400 of FIG. 44 and/or, moregenerally, to generate a code frequency index table. A processor, acontroller and/or any other suitable processing device may be usedand/or programmed to execute the example machine-accessible instructionsof FIG. 45. For example, the machine-accessible instructions of FIG. 45may be embodied in coded instructions stored on any combination oftangible article of manufacture such as a tangible computer-readablemedium discussed above in connection with FIG. 17. Machine-readableinstructions comprise, for example, instructions and data that cause aprocessor, a computer and/or a machine having a processor (e.g., theexample processor platform P100 discussed above in connection with FIG.24) to perform one or more particular processes. Alternatively, some orall of the example machine-accessible instructions of FIG. 45 may beimplemented using any combination(s) of ASIC(s), PLD(s), FPLD(s),FPGA(s), discrete logic, hardware, firmware, etc. Also, some or all ofthe example processes of FIG. 45 may be implemented manually or as anycombination of any of the foregoing techniques, for example, anycombination of firmware, software, discrete logic and/or hardware.Further, many other methods of implementing the example operations ofFIG. 45 may be employed. For example, the order of execution of theblocks may be changed, and/or one or more of the blocks described may bechanged, eliminated, sub-divided, or combined. Additionally, any or allof the example machine-accessible instructions of FIG. 45 may be carriedout sequentially and/or carried out in parallel by, for example,separate processing threads, processors, devices, discrete logic,circuits, etc.

The example machine-accessible instructions of FIG. 45 may be used togenerate any number of LUTs, such as the LUT of FIGS. 40-42. While anexample process 4500 is shown, other processes may be used. The resultof the process 4500 is a code frequency index LUT, wherein: (1) twosymbols of the table are represented by no more than one commonfrequency index, (2) not more than one of the frequency indicesrepresenting a symbol reside in one audio critical band as defined bythe MPEG-AA compression standard ISO/IEC 13818-7:1997, and (3) codefrequencies of neighboring critical bands are not used to represent asingle symbol. Criteria number 3 helps to ensure that audio quality isnot compromised during the audio encoding process.

The example process 4500 of FIG. 45 begins by defining a number (P) ofcritical band pairs. For example, referring to FIG. 46, a table 4600includes columns representing AAC critical band indices 4602, shortblock indices 4604 in the range of the AAC indices, and long blockindices 4606 in the range of the AAC indices. In some examples, thevalue of P may be seven and, thus, seven critical band pairs are formedfrom the AAC indices (block 4502). FIG. 47 shows the frequencyrelationship between the AAC indices. According to an example, as shownat reference numeral 4702 in FIG. 47 wherein frequencies of criticalband pairs are shown as separated by dotted lines, AAC indices may beselected into pairs as follows: five and six, seven and eight, nine andten, eleven and twelve, thirteen and fourteen, fifteen and sixteen, andseventeen and seventeen. The AAC index of seventeen includes a widerange of frequencies and, therefore, index 17 is shown twice, once forthe low portion and once for the high portion.

After the band pairs have been defined (block 4502), a number offrequencies (N) is selected for use in each critical band pair (block4504). In some examples, the value of N is sixteen, meaning that thereare sixteen data positions in the combination of the critical bands thatform each critical band pair. As shown in FIG. 47 as reference numeral4704, the seventeen frequency positions are shown. The circled positionfour is reserved for synchronization information and, therefore, is notused for data.

After the number of critical band pairs and the number of frequencypositions in the pairs is defined, the process 4500 generates all N^(P),P-digit numbers with no more than one hexadecimal digit in common (block4506). For example, if N is 16 and P is 7, the process generates thenumbers 0 through 268435456, but may do so in base 16—hexadecimal, whichwould results in 0 through FFFFFFF, but does not include the numbersthat share more than one common hexadecimal digit. This ensurescompliance with criteria (1) above because, as described below, thedigits will be representative of the frequencies selected to representsymbols.

According to an example process for determining a set of numbers thatcomply with criteria (1) above (and any other desired criteria), thenumbers in the range from 0 to N^(P)-1 are tested. First, the valuecorresponding to zero is stored as the first member of the result set R.Then, the numbers from 1 to N^(P)−1 are selected for analysis todetermine if they meet criteria (1) when compared to the members of R.Each number that meets criteria (1) when compared against all thecurrent entries in R is added to the result set. In particular,according to the example process, in order to test a number K, eachhexadecimal digit of interest in K is compared to the correspondinghexadecimal digit of interest in an entry M from the current result set.In the 7 comparisons not more than one hexadecimal digit of K shouldequal the corresponding hexadecimal digit of M. If, after comparing Kagainst all numbers currently in the result set, no member of the latterhas more than one common hexadecimal digit, then K is added to theresult set R. The algorithm iterates through the set of possible numbersuntil all values meeting criteria (1) have been identified.

While the foregoing describes an example process for determining a setof numbers that meets criteria (1), any process or algorithm may be usedand this disclosure is not limited to the process described above. Forexample, a process may use heuristics, rules, etc. to eliminate numbersfrom the set of numbers before iterating throughout the set. Forexample, all of the numbers where the relevant bits start with two 0's,two 1's, two 2's, etc. and end with two 0's, two 1's, two 2's, etc.could immediately be removed because they will definitely have a hammingdistance less than 6. Additionally or alternatively, an example processmay not iterate through the entire set of possible numbers. For example,a process could iterate until enough numbers are found (e.g., 128numbers when 128 symbols are desired). In another implementation, theprocess may randomly select a first value for inclusion in the set ofpossible values and then may search iteratively or randomly through theremaining set of numbers until a value that meets the desired criteria(e.g., criteria (1)) is found.

The process 4500 then selects the desired numbers from the generatedvalues (block 4510). For example, if the symbol space is 129 symbols,the remaining numbers are reduced to a count of 129. The reduction maybe carried out at random, or by selecting remaining numbers with thegreatest Euclidean distance, or my any other suitable data reductiontechnique.

After the foregoing reductions, the count of the list of numbers isequal to the number of symbols in the symbol space. Accordingly, theremaining numbers in base P format are defined to represent frequencyindices representative of symbols in the critical band pairs (block4512). For example, referring to FIG. 47, the hexadecimal number F1E4B0Fis in base 16, which matches P. The first digit of the hexadecimalnumber maps to a frequency component in the first critical band pair,the second digit to the second critical band pair, and so on. Each digitrepresents the frequency index that will be used to represent the symbolcorresponding to the hexadecimal number F1E4B0F.

Using the first hexadecimal number as an example of mapping to aparticular frequency index, the decimal value of Fh is 15. Becauseposition four of each critical band pair is reserved for non-datainformation, the value of any hexadecimal digit greater than four isincremented by the value of one decimal. Thus, the 15 becomes a 16. The16 is thus designated (as shown with the asterisk in FIG. 47) as beingthe code frequency component in the first critical band pair torepresent the symbol corresponding to the hexadecimal number F1E4B0F.Though not shown in FIG. 47, the index 1 position (e.g., the secondposition from the far left in the critical band 7 would be used torepresent the hexadecimal number F1E4B0F.

After assigning the representative code frequencies (block 4512), thenumbers are filled into a LUT (block 4514).

Of course, the systems and processes described in conjunction with FIGS.45-47 are only examples that may be used to generate LUTs having desiredproperties in conjunction the encoding and decoding systems describedherein. Other configurations and processes may be used. For example,LUTs may be generated using other code frequency plans.

Audio Decoding

FIG. 48 illustrates an example manner of decoding Nielsen codes and/orimplementing the example decoder 3816 of FIG. 38, the example decoder310 of FIG. 3 and/or the example secondary content triggerer 180 ofFIGS. 1 and 2. While the decoder illustrated in FIG. 38 may be used toimplement any of the decoders 3816, 310 and 180, for ease of discussionthe decoder of FIG. 38 will be referred to as decoder 3816. In someexamples, two instances of the example decoder 3816 may be implemented.A first instance enables a stacker 4804 to enhance the decoding of astation identifier and a coarse time stamp that increments once every 64seconds, and a second instance disables the stacker 4804 to decodevariable data in a last 7 bit group 3932 representing time increments inseconds, which varies from message to message. In other examples, asingle decoder 3816 instance is implemented with the stacker 4804enabled or disabled as described below.

In general, the decoder 3816 detects a code signal that was insertedinto received audio to form encoded audio at the encoder 3802. That is,the decoder 3816 looks for a pattern of emphasis in code frequencies itprocesses. Once the decoder 3816 has determined which of the codefrequencies have been emphasized, the decoder 3816 determines, based onthe emphasized code frequencies, the symbol present within the encodedaudio. The decoder 3816 may record the symbols, or may decode thosesymbols into the codes that were provided to the encoder 3802 forinsertion into the audio.

In one implementation, the example decoder 3816 of FIG. 48 may beimplemented using, for example, a digital signal processor programmedwith instructions to implement components of the decoder 3816. Ofcourse, any other implementation of the example decoder 3816 ispossible. For example, the decoder 3816 may be implemented using one ormore processors, programmable logic devices, or any suitable combinationof hardware, software, and firmware.

As shown in FIG. 48, an example decoder 3816 includes a sampler 4802,which may be implemented using an analog to digital converter (A/D) orany other suitable technology, to which encoded audio is provided inanalog format. As shown in FIG. 38, the encoded audio may be provided bya wired or wireless connection to the receiver 3810. The sampler 4802samples the encoded audio at, for example, a sampling frequency of 8 kHzor 12 kHz. Of course, other sampling frequencies may be advantageouslyselected in order to increase resolution or reduce the computationalload at the time of decoding. At a sampling frequency of 8 kHz, theNyquist frequency is 4 kHz and, therefore, all of the embedded codesignals represented in the example LUT 3932 of FIGS. 40-41 are preservedbecause their spectral frequencies are lower than the Nyquist frequency.Were a frequency plan including higher frequencies utilized, a highersampling frequency such as 12 kHz may be needed to ensure the Nyquistsampling criteria is satisfied.

The samples from the sampler 4802 are provided to a stacker 4804. Ingeneral, the stacker 4804 accentuates the code signal in the audiosignal information by taking advantage of the fact that messages arerepeated or substantially repeated (e.g., only the least significantbits are changed) for a period of time. For example, 42 bits (3926 ofFIG. 39) of the 49 bits (3926 and 3924) of the previously describedexample message of FIG. 39 remain constant for 64 seconds (32 2-secondmessage intervals) when the 42 bits of data 3926 in the message includea station identifier and a coarse time stamp which increments once every64 seconds. The variable data in the last 7 bit group 3932 representstime increments in seconds and, thus, varies from message to message.The example stacker 4804 aggregates multiple blocks of audio signalinformation to accentuate the code signal in the audio signalinformation. In an example implementation, the stacker 4804 comprises abuffer to store multiple samples of audio information. For example, if acomplete message is embedded in two seconds of audio, the buffer may betwelve seconds long to store six messages. The example stacker 4804additionally comprises an adder to sum the audio signal informationassociated with the six messages and a divider to divide the sum by thenumber of repeated messages selected (e.g., six).

By way of example, a watermarked signal y(t) can be represented by thesum of the host signal x(t) and watermark w(t):

y(t)=x(t)+w(t)

In the time domain, watermarks may repeat after a known period T:

w(t)=w(t−T)

According to an example stacking method, the input signal y(t) isreplaced by a stacked signal S(t):

${S(t)} = \frac{{y(t)} + {y\left( {t - T} \right)} + \ldots + {y\left( {t - {\left( {n - 1} \right)T}} \right)}}{n}$

In the stacked signal S(t), the contribution of the host signaldecreases because the values of samples x(t), x(t−T), . . . , x(t−nT)are independent if the period T is sufficiently large. At the same time,the contribution of the watermarks being made of, for example, in-phasesinusoids, is enhanced.

${S(t)} = {\frac{{x(t)} + {x\left( {t - T} \right)} + \ldots + {x\left( {t - {\left( {n - 1} \right)T}} \right)}}{n} + {w(t)}}$

Assuming x(t), x(t−T), . . . , x(t−nT) are independent random variablesdrawn from the same distribution X with zero mean E[X]=0:

$\left. {\lim\limits_{n\rightarrow\infty}{E\left\lbrack \frac{{x(t)} + {x\left( {t - T} \right)} + \ldots + {x\left( {t - {\left( {n - 1} \right)T}} \right)}}{n} \right\rbrack}}\rightarrow 0 \right.,{and}$${{Var}\left\lbrack \frac{{x(t)} + {x\left( {t - T} \right)} + \ldots + {x\left( {t - {\left( {n - 1} \right)T}} \right)}}{n} \right\rbrack} = \frac{{Var}(X)}{n}$

Accordingly, the underlying host signal contributions x(t), . . . ,x(t−nT) will effectively be canceling each other while the watermark isunchanged allowing the watermark to be more easily detected.

In the illustrated example, the power of the resulting signal decreaseslinearly with the number of stacked signals n. Therefore, averaging overindependent portions of the host signal can reduce the effects ofinterference. The watermark is not affected because it will always beadded in-phase.

An example process for implementing the stacker 4804 is described inconjunction with FIG. 49.

The decoder 3816 may additionally include a stacker controller 4806 tocontrol the operation of the stacker 4804. The example stackercontroller 4806 receives a signal indicating whether the stacker 4804should be enabled or disabled. For example, the stacker controller 4806may receive the received audio signal and may determine if the signalincludes significant noise that will distort the signal and, in responseto the determination, cause the stacker to be enabled. In anotherimplementation, the stacker controller 4806 may receive a signal from aswitch that can be manually controlled to enable or disable the stacker4804 based on the placement of the decoder 3816. For example, when thedecoder 3816 is wired to the receiver 3810 or the microphone 3820 isplaced in close proximity to the speaker 3814, the stacker controller4806 may disable the stacker 4804 because stacking will not be neededand will cause corruption of rapidly changing data in each message(e.g., the least significant bits of a timestamp). Alternatively, whenthe decoder 3816 is located at a distance from the speaker 3814 or inanother environment where significant interference may be expected, thestacker 4804 may be enabled by the stacker controller 4806. Further, thestacker 4804 may be disabled when a) the sampling rate accuracy of thesampler 4802 and/or the highest frequency used to convey messages areselected such that the stacking may have limited effect, and/or b) thevariable data in the last 7 bit group 3932 representing time incrementsin seconds, which varies from message to message, is to be decoded. Ofcourse, any type of desired control may be applied by the stackercontroller 4806.

The output of the stacker 4804 is provided to a time to frequency domainconverter 4808. The time to frequency domain converter 4808 may beimplemented using a Fourier transform such as a DFT, or any othersuitable technique to convert time-based information intofrequency-based information. In some examples, the time to frequencydomain converter 4808 may be implemented using a sliding long block fastFourier transform (FFT) in which a spectrum of the code frequencies ofinterest is calculated each time eight new samples are provided to theexample time to time to frequency domain converter 4808. In someexamples, the time to frequency domain converter 4808 uses 1,536 samplesof the encoded audio and determines a spectrum therefrom using 192slides of eight samples each. The resolution of the spectrum produced bythe time to frequency domain converter 4808 increases as the number ofsamples used to generate the spectrum is increased. Thus, the number ofsamples processed by the time to frequency domain converter 4808 shouldmatch the resolution used to select the indices in the tables of FIGS.40-42.

The spectrum produced by the time to frequency domain converter 4808passes to a critical band normalizer 4810, which normalizes the spectrumin each of the critical bands. In other words, the frequency with thegreatest amplitude in each critical band is set to one and all otherfrequencies within each of the critical bands are normalizedaccordingly. For example, if critical band one includes frequencieshaving amplitudes of 112, 56, 56, 56, 56, 56, and 56, the critical bandnormalizer would adjust the frequencies to be 1, 0.5, 0.5, 0.5, 0.5,0.5, and 0.5. Of course, any desired maximum value may be used in placeof one for the normalization. The critical band normalizer 4810 outputsthe normalized score for each of the frequencies of the interest.

The spectrum of scores produced by the critical band normalizer 4810 ispassed to the symbol scorer 4812, which calculates a total score foreach of the possible symbols in the active symbol table. In an exampleimplementation, the symbol scorer 4812 iterates through each symbol inthe symbol table and sums the normalized score from the critical bandnormalizer 4810 for each of the frequencies of interest for theparticular symbol to generate a score for the particular symbol. Thesymbol scorer 4812 outputs a score for each of the symbols to the maxscore selector 4814, which selects the symbol with the greatest scoreand outputs the symbol and the score.

The identified symbol and score from the max score selector 4814 arepassed to the comparator 4816, which compares the score to a threshold.When the score exceeds the threshold, the comparator 4816 outputs thereceived symbol. When the score does not exceed the threshold, thecomparator 4816 outputs an error indication. For example, the comparator4816 may output a symbol indicating an error (e.g., a symbol notincluded in the active symbol table) when the score does not exceed thethreshold. Accordingly, when a message has been corrupted such that agreat enough score (i.e., a score that does not exceed the threshold) isnot calculated for a symbol, an error indication is provided. In anexample implementation, error indications may be provided to the stackercontroller 4806 to cause the stacker 4804 to be enabled when a thresholdnumber of errors are identified (e.g., number of errors over a period oftime, number of consecutive errors, etc.).

The identified symbol or error from the comparator 4816 is passed to thecircular buffers 4818 and the pre-existing code flag circular buffers4820. An example implementation of the standard buffers 4818 isdescribed in conjunction with FIG. 52. The example circular buffers 4818comprise one circular buffer for each slide of the time domain tofrequency domain converter 4808 (e.g., 192 buffers). Each circularbuffer of the circular buffers 4818 includes one storage location forthe synchronize symbol and each of the symbol blocks in a message (e.g.,eight block messages would be stored in eight location circular buffers)so that an entire message can be stored in each circular buffer.Accordingly, as the audio samples are processed by the time domain tofrequency domain converter 4808, the identified symbols are stored inthe same location of each circular buffer until that location in eachcircular buffer has been filled. Then, symbols are stored in the nextlocation in each circular buffer. In addition to storing symbols, thecircular buffers 4818 may additionally include a location in eachcircular buffer to store a sample index indicating the sample in theaudio signal that was received that resulted in the identified symbol.

The example pre-existing code flag circular buffers 4820 are implementedin the same manner as the circular buffers 4818, except the pre-existingcode flag circular buffers 4820 include one location for thepre-existing code flag synchronize symbol and one location for eachsymbols in the pre-existing code flag message (e.g., an pre-existingcode flag synchronize that includes one message symbol would be storedin two location circular buffers). The pre-existing code flag circularbuffers 4820 are populated at the same time and in the same manner asthe circular buffers 4818.

The example message identifier 4822 analyzes the circular buffers 4818and the pre-existing code flag circular buffers 4820 for a synchronizesymbol. For example, the message identifier 4822 searches for asynchronize symbol in the circular buffers 4818 and an pre-existing codeflag synchronize symbol in the pre-existing code flag circular buffers4820. When a synchronize symbol is identified, the symbols following thesynchronize symbol (e.g., seven symbols after a synchronize symbol inthe circular buffers 4818 or one symbol after an pre-existing code flagsynchronize symbol in the pre-existing code flag circular buffers 4820)are output by the message identifier 4822. In addition, the sample indexidentifying the last audio signal sample processed is output.

The message symbols and the sample index output by the messageidentifier 4822 are passed to the validator 4824, which validates eachmessage. The validator 4824 includes a filter stack that stores severalconsecutively received messages. Because messages are repeated (e.g.,every 2 seconds or 16,000 samples at 8 kHz, or every 1.6 seconds at 12kHz), each message may be compared with other messages in the filterstack that are separated by approximately the number of audio samples ina single message to determine if a match exists. If a match orsubstantial match exists, both messages are validated. If a messagecannot be identified, it is determined that the message is an error andis not emitted from the validator 4824. In cases where messages might beaffected by noise interference, messages might be considered a matchwhen a subset of symbols in a message match the same subset in anotheralready validated message. For example, if four of seven symbols in amessage match the same four symbols in another message that has alreadybeen validated, the message can be identified as partially validated.Then, a sequence of the repeated messages can be observed to identifythe non-matching symbols in the partially validated message.

Further, for each hypothetical long block that is analyzed duringdecoding, a score that represents the strength and/or probability thatthe decoding decision is correct may be computed. For example, for eachof the seven frequencies that constitute a potential code pattern dividethe power of that frequency by the average power of the other codefrequencies in its code band. By summing this value across the sevenfrequencies a score for each potential pattern can be determined. Theselected pattern is the code pattern with the highest score and thatexceeds a certain minimum threshold. To improved decoding accuracy, thescore of the winning pattern may be combined with that of the score(s)corresponding to the same pattern at a long block location that isexactly 3, 6, 9, etc. message slots away from the current location. Ifthis long block is one of the 6 long blocks of the message that carriesa substantially constant payload, the score of the winning pattern willbe enhanced. However, such stacking does not help the 7^(th) long blockwhich contains information that changes from message to message. Bystacking, code detection accuracy may be increased by a factor of 2 or3, without being sensitive to sampling rate inaccuracies and/or jitter.Other example methods and apparatus to increase the accuracy ofwatermark decoding are described in U.S. patent application Ser. No.12/604,176, entitled “Methods and Apparatus to Extract Data Encoded inMedia Content,” and filed Oct. 22, 2009.

The validated messages from the validator 4824 are passed to the symbolto bit converter 4826, which translates each symbol to the correspondingdata bits of the message using the active symbol table.

While an example manner of implementing the example decoder 3816 of FIG.38 is illustrated in FIG. 48, one or more of the interfaces, datastructures, elements, processes and/or devices illustrated in FIG. 48may be combined, divided, re-arranged, omitted, eliminated and/orimplemented in any other way. Further, the example sampler 4802, theexample stacker 4804, the example stacker controller 4806, the exampletime domain to frequency domain 4808, the example critical bandnormalizer 4810, the example symbol scorer 4812, the example max scoreselector 4814, the comparator 4816, the example circular buffers 4818,the example pre-existing code flag circular buffers 4820, the examplemessage identifier 4822, the example validator 4824, the example symbolto bit converter 4826 and/or, more generally, the example system decoder3816 of FIG. 48 may be implemented by hardware, software, firmwareand/or any combination of hardware, software and/or firmware. Thus, forexample, any of the example sampler 4802, the example stacker 4804, theexample stacker controller 4806, the example time domain to frequencydomain 4808, the example critical band normalizer 4810, the examplesymbol scorer 4812, the example max score selector 4814, the comparator4816, the example circular buffers 4818, the example pre-existing codeflag circular buffers 4820, the example message identifier 4822, theexample validator 4824, the example symbol to bit converter 4826 and/or,more generally, the example system decoder 3816 may be implemented byone or more circuit(s), programmable processor(s), ASIC(s), PLD(s),FPLD(s), and/or FPGA(s), etc. When any apparatus claim of this patentincorporating one or more of these elements is read to cover a purelysoftware and/or firmware implementation, at least one of the examplesampler 4802, the example stacker 4804, the example stacker controller4806, the example time domain to frequency domain 4808, the examplecritical band normalizer 4810, the example symbol scorer 4812, theexample max score selector 4814, the comparator 4816, the examplecircular buffers 4818, the example pre-existing code flag circularbuffers 4820, the example message identifier 4822, the example validator4824, the example symbol to bit converter 4826 and/or, more generally,the example system decoder 3816 are hereby expressly defined to includea tangible article of manufacture such as a tangible computer-readablemedium such as those described above in connection with FIG. 17 storingthe firmware and/or software. Further still, the example decoder 3816may include interfaces, data structures, elements, processes and/ordevices instead of, or in addition to, those illustrated in FIG. 48and/or may include more than one of any or all of the illustratedinterfaces, data structures, elements, processes and/or devices.

FIGS. 49-52 and 55 illustrate example machine-accessible instructionsthat may be executed to implement the example decoder 3816 of FIG. 48. Aprocessor, a controller and/or any other suitable processing device maybe used and/or programmed to execute the example machine-accessibleinstructions of FIGS. 49-52 and 55. For example, the machine-accessibleinstructions of FIGS. 49-52 and 55 may be embodied in coded instructionsstored on any combination of tangible article of manufacture such as atangible computer-readable medium discussed above in connection withFIG. 17. Machine-readable instructions comprise, for example,instructions and data that cause a processor, a computer and/or amachine having a processor (e.g., the example processor platform P100discussed above in connection with FIG. 24) to perform one or moreparticular processes. Alternatively, some or all of the examplemachine-accessible instructions of FIGS. 49-52 and 55 may be implementedusing any combination(s) of ASIC(s), PLD(s), FPLD(s), FPGA(s), discretelogic, hardware, firmware, etc. Also, some or all of the exampleprocesses of FIGS. 49-52 and 55 may be implemented manually or as anycombination of any of the foregoing techniques, for example, anycombination of firmware, software, discrete logic and/or hardware.Further, many other methods of implementing the example operations ofFIGS. 49-52 and 55 may be employed. For example, the order of executionof the blocks may be changed, and/or one or more of the blocks describedmay be changed, eliminated, sub-divided, or combined. Additionally, anyor all of the example machine-accessible instructions of FIGS. 49-52 and55 may be carried out sequentially and/or carried out in parallel by,for example, separate processing threads, processors, devices, discretelogic, circuits, etc.

The example process 4900 of FIG. 49 begins by sampling audio (block4902). The audio may be obtained via an audio sensor, a hardwiredconnection, via an audio file, or through any other suitable technique.As explained above the sampling may be carried out at 8,000 Hz, or anyother suitable frequency.

As each sample is obtained, the sample is aggregated by a stacker suchas the example stacker 4804 of FIG. 48 (block 4904). An example processfor performing the stacking is described in conjunction with FIG. 50.

The new stacked audio samples from the stacker process 4904 are insertedinto a buffer and the oldest audio samples are removed (block 4906). Aseach sample is obtained, a sliding time to frequency conversion isperformed on a collection of samples including numerous older samplesand the newly added sample obtained at blocks 4902 and 4904 (block4908). In some examples, a sliding FFT may be used to process streaminginput samples including 9215 old samples and the one newly added sample.In some examples, the FFT using 9216 samples results in a spectrumhaving a resolution of 5.2 Hz.

After the spectrum is obtained through the time to frequency conversion(block 4908), the transmitted symbol is determined (block 4910). Anexample process for determining the transmitted symbol is described inconjunction with FIG. 51.

After the transmitted message is identified (block 4910), buffer postprocessing is performed to identify a synchronize symbol andcorresponding message symbols (block 4912). An example process forperforming post-processing is described in conjunction with FIG. 52.

After post processing is performed to identify a transmitted message(block 4912), message validation is performed to verify the validity ofthe message (block 4914). An example process for performing the messagevalidation is described in conjunction with FIG. 55.

After a message has been validated (block 4914), the message isconverted from symbols to bits using the active symbol table (block4916). Control then returns to block 4806 to process the next set ofsamples.

FIG. 50 illustrates an example process for stacking audio signal samplesto accentuate an encoded code signal to implement the stack audioprocess 4904 of FIG. 49. The example process may be carried out by thestacker 4804 and the stacker controller 4806 of FIG. 48. The exampleprocess begins by determining if the stacker control is enabled (block5002). When the stacker control is not enabled, no stacking is to occurand the process of FIG. 50 ends and control returns to block 4906 ofFIG. 49 to process the audio signal samples unstacked.

When the stacker control is enabled, newly received audio signal samplesare pushed into a buffer and the oldest samples are pushed out (block5004). The buffer stores a plurality of samples. For example, when aparticular message is repeatedly encoded in an audio signal every twoseconds and the encoded audio is sampled at 8 kHz, each message willrepeat every 16,000 samples so that buffer will store some multiple of16,000 samples (e.g., the buffer may store six messages with a 96,000sample buffer). Then, the stacker 4808 selects substantially equalblocks of samples in the buffer (block 5006). The substantially equalblocks of samples are then summed (block 5008). For example, sample oneis added to samples 16,001, 32,001, 48,001, 64,001, and 80,001, sampletwo is added to samples 16,002, 32,002, 48,002, 64,002, 80,002, sample16,000 is added to samples 32,000, 48,000, 64,000, 80,000, and 96,000.

After the audio signal samples in the buffer are added, the resultingsequence is divided by the number of blocks selected (e.g., six blocks)to calculate an average sequence of samples (e.g., 16,000 averagedsamples) (block 5010). The resulting average sequence of samples isoutput by the stacker (block 5012). The process of FIG. 50 then ends andcontrol returns to block 4906 of FIG. 49.

FIG. 51 illustrates an example process for implementing the symboldetermination process 4910 after the received audio signal has beenconverted to the frequency domain. The example process of FIG. 51 may beperformed by the decoder 3816 of FIGS. 38 and 48. The example process ofFIG. 51 begins by normalizing the code frequencies in each of thecritical bands (block 5102). For example, the code frequencies may benormalized so that the frequency with the greatest amplitude is set toone and all other frequencies in that critical band are adjustedaccordingly. In the example decoder 3816 of FIG. 48, the normalizationis performed by the critical band normalizer 4810.

After the frequencies of interest have been normalized (block 5102). Theexample symbol scorer 4812 selects the appropriate symbol table based onthe previously determined synchronization table (block 5104). Forexample, a system may include two symbol tables: one table for a normalsynchronization and one table for an pre-existing code flagsynchronization. Alternatively, the system may include a single symboltable or may include multiple synchronization tables that may beidentified by synchronization symbols (e.g., cross-table synchronizationsymbols). The symbol scorer 4812 then computes a symbol score for eachsymbol in the selected symbol table (block 5106). For example, thesymbol scorer 4812 may iterate across each symbol in the symbol tableand add the normalized scores for each of the frequencies of interestfor the symbol to compute a symbol score.

After each symbol is scored (block 5106), the example max score selector4814 selects the symbol with the greatest score (block 5108). Theexample comparator 4816 then determines if the score for the selectedsymbol exceeds a maximum score threshold (block 5110). When the scoredoes not exceed the maximum score threshold, an error indication isstored in the circular buffers (e.g., the circular buffers 4818 and thepre-existing code flag circular buffers 4820) (block 5112). The processof FIG. 51 then completes and control returns to block 4912 of FIG. 49.

When the score exceeds the maximum score threshold (block 5110), theidentified symbol is stored in the circular buffers (e.g., the circularbuffers 4818 and the pre-existing code flag circular buffers 4820)(block 5114). The process of FIG. 51 then completes and control returnsto block 4912 of FIG. 49.

FIG. 52 illustrates an example process for implementing the buffer postprocessing 4912 of FIG. 49. The example process of FIG. 52 begins whenthe message identifier 4822 of FIG. 48 searches the circular buffers4818 and the circular buffers 4820 for a synchronization indication(block 5202).

For example, FIG. 53 illustrates an example implementation of circularbuffers 4818 and FIG. 54 illustrates an example implementation ofpre-existing code flag circular buffers 4820. In the illustrated exampleof FIG. 53, the last location in the circular buffers to have beenfilled is location three as noted by the arrow. Accordingly, the sampleindex indicates the location in the audio signal samples that resultedin the symbols stored in location three. Because the line correspondingto sliding index 37 is a circular buffer, the consecutively identifiedsymbols are 128, 57, 22, 111, 37, 23, 47, and 0. Because 128 in theillustrated example is a synchronize symbol, the message can beidentified as the symbols following the synchronize symbol. The messageidentifier 4822 would wait until 7 symbols have been located followingthe identification of the synchronization symbol at sliding index 37.

The pre-existing code flag circular buffers 4820 of FIG. 54 include twolocations for each circular buffer because the pre-existing code flagmessage of the illustrated example comprises one pre-existing code flagsynchronize symbol (e.g., symbol 254) followed by a single messagesymbol. According to the illustrated example of FIG. 39, thepre-existing code flag data block 3930 is embedded in two long blocksimmediately following the 7 bit timestamp long block 3928. Accordingly,because there are two long blocks for the pre-existing code flag dataand each long block of the illustrated example is 1,536 samples at asampling rate of 8 kHz, the pre-existing code flag data symbol will beidentified in the pre-existing code flag circular buffers 3072 samplesafter the original message. In the illustrated example FIG. 54, slidingindex 37 corresponds to sample index 38744, which is 3072 samples laterthan sliding index 37 of FIG. 53 (sample index 35672). Accordingly, thepre-existing code flag data symbol 68 can be determined to correspond tothe message in sliding index 37 of FIG. 53, indicating that the messagein sliding index 37 of FIG. 53 identifies an original encoded message(e.g., identifies an original broadcaster of audio) and the slidingindex 37 identifies an pre-existing code flag message (e.g., identifiesa re-broadcaster of audio).

Returning to FIG. 49, after a synchronize or pre-existing code flagsynchronize symbol is detected, messages in the circular buffers 4818 orthe pre-existing code flag circular buffers 4820 are condensed toeliminate redundancy in the messages. For example, as illustrated inFIG. 53, due to the sliding time domain to frequency domain conversionand duration of encoding for each message, messages are identified inaudio data for a period of time (sliding indexes 37-39 contain the samemessage). The identical messages in consecutive sliding indexes can becondensed into a single message because they are representative of onlyone encoded message. Alternatively, condensing may be eliminated and allmessages may be output when desired. The message identifier 4822 thenstores the condensed messages in a filter stack associated with thevalidator 4824 (block 5206). The process of FIG. 52 then ends andcontrol returns to block 4914 of FIG. 49.

FIG. 55 illustrates an example process to implement the messagevalidation process 4914 of FIG. 49. The example process of FIG. 49 maybe performed by the validator 4824 of FIG. 48. The example process ofFIG. 55 begins when the validator 4824 reads the top message in thefilter stack (block 5502).

For example, FIG. 56 illustrates an example implementation of a filterstack. The example filter stack includes a message index, seven symbollocations for each message index, a sample index identification, and avalidation flag for each message index. Each message is added at messageindex M7 and a message at location M0 is the top message that is read inblock 5502 of FIG. 55. Due to sampling rate variation and variation ofthe message boundary within a message identification, it is expectedthat messages will be separated by samples indexes of multiples ofapproximately 16,000 samples when messages are repeated every 16,000samples.

Returning to FIG. 56, after the top message in the filter stack isselected (block 5502), the validator 4824 determines if the validationflag indicates that the message has been previously validated (block5504). For example, FIG. 56 indicates that message M0 has beenvalidated. When the message has been previously validated, the validator4824 outputs the message (block 5512) and control proceeds to block5516.

When the message has not been previously validated (block 5504), thevalidator 4824 determines if there is another suitably matching messagein the filter stack (block 5506). A message may be suitably matchingwhen it is identical to another message, when a threshold number ofmessage symbols match another message (e.g., four of the seven symbols),or when any other error determination indicates that two messages aresimilar enough to speculate that they are the same. According to theillustrated example, messages can only be partially validated withanother message that has already been validated. When a suitable matchis not identified, control proceeds to block 5514.

When a suitable match is identified, the validator 4824 determines if atime duration (e.g., in samples) between identical messages is proper(block 5508). For example, when messages are repeated every 16,000samples, it is determined if the separation between two suitablymatching messages is approximately a multiple of 16,000 samples. Whenthe time duration is not proper, control proceeds to block 5514.

When the time duration is proper (block 5508), the validator 4824validates both messages by setting the validation flag for each of themessages (block 5510). When the message has been validated completely(e.g., an exact match) the flag may indicate that the message is fullyvalidated (e.g., the message validated in FIG. 56). When the message hasonly been partially validated (e.g., only four of seven symbolsmatched), the message is marked as partially validated (e.g., themessage partially validated in FIG. 56). The validator 4824 then outputsthe top message (block 5512) and control proceeds to block 5516.

When it is determined that there is not a suitable match for the topmessage (block 5506) or that the time duration between a suitablematch(es) is not proper (block 5508), the top message is not validated(block 5514). Messages that are not validated are not output from thevalidator 4824.

After determining not to validate a message (blocks 5506, 5508, and5514) or outputting the top message (block 5512), the validator 5516pops the filter stack to remove the top message from the filter stack.Control then returns to block 5502 to process the next message at thetop of the filter stack.

While example manners of implementing any or all of the example encoder3802 and the example decoder 3816 have been illustrated and describedabove one or more of the data structures, elements, processes and/ordevices illustrated in the drawings and described above may be combined,divided, re-arranged, omitted, eliminated and/or implemented in anyother way. Further, the example encoder 3802 and example decoder 3816may be implemented by hardware, software, firmware and/or anycombination of hardware, software and/or firmware. Thus, for example,the example encoder 3802 and the example decoder 3816 could beimplemented by one or more circuit(s), programmable processor(s),application specific integrated circuit(s) (ASIC(s)), programmable logicdevice(s) (PLD(s)) and/or field programmable logic device(s) (FPLD(s)),etc. For example, the decoder 3816 may be implemented using software ona platform device, such as a mobile telephone. If any of the appendedclaims is read to cover a purely software implementation, at least oneof the prior code detector 3904, the example message generator 3910, thesymbol selector 3912, the code frequency selector 3914, the synthesizer3916, the inverse FFT 3918, the mixer 3920, the overlapping short blockmaker 3940, the masking evaluator 3942, the critical band pair definer4402, the frequency definer 4404, the number generator 4406, theredundancy reducer 4408, the excess reducer 4410, the code frequencydefiner 4412, the LUT filler 4414, the sampler 4802, the stacker 4804,the stacker control 4806, the time domain to frequency domain converter4808, the critical band normalize 4810, the symbol scorer 4812, the maxscore selector 4814, the comparator 4816, the circular buffers 4818, thepre-existing code flag circular buffers 4820, the message identifier4822, the validator 4824, and the symbol to bit converter 4826 arehereby expressly defined to include a tangible medium such as a memory,DVD, CD, etc. Further still, the example encoder 3802 and the exampledecoder 3816 may include data structures, elements, processes and/ordevices instead of, or in addition to, those illustrated in the drawingsand described above, and/or may include more than one of any or all ofthe illustrated data structures, elements, processes and/or devices.

Although certain example methods, apparatus and articles of manufacturehave been described herein, the scope of coverage of this patent is notlimited thereto. On the contrary, this patent covers all methods,apparatus and articles of manufacture fairly falling within the scope ofthe claims of this patent either literally or under the doctrine ofequivalents.

What is claimed is:
 1. An apparatus comprising: a code frequency monitorto: determine characteristics of frequencies in a plurality of codebands of a frequency domain representation of an audio signal that maycontain a code, the code representative of at least one of a first mediaor a broadcaster of the first media, the code, if present, being encodedin the audio signal using a plurality of frequency components across theplurality of code bands; and normalize the characteristics of thefrequencies of respective ones of the code bands, the characteristicfrequencies of a first one of the code bands being normalized against athreshold characteristic of a first frequency in the first one of thecode bands; a symbol determiner to: compare sums of the normalizedcharacteristics for groups of frequencies across the plurality of codebands to identify a first group of frequencies with a largest sum; anddetermine that the first group of frequencies is representative of thecode and decode the code from the first group of frequencies; and awireless interface to transmit a wireless signal to a media presentationdevice, the wireless signal including the decoded code, the wirelesssignal to 1) cause the media presentation device to obtain second mediabased on the decoded code and 2) determine audience rating informationcorresponding to presentation of the first media and the second media onthe media presentation device based on the decoded code.
 2. Theapparatus of claim 1, wherein the audience rating information includes afirst reach and a second reach, the first reach corresponding topresentation of the first media and the second reach corresponding topresentation of the second media based on the decoded code.
 3. Theapparatus of claim 1, wherein to obtain the second media, the mediapresentation device is to obtain a link to the second media, the linkselectable by a viewer.
 4. The apparatus of claim 3, wherein theaudience rating information corresponding to presentation of the secondmedia is determined in response to the viewer selecting the link to thesecond media.
 5. The apparatus of claim 1, wherein the second media isobtained from a secondary content server.
 6. The apparatus of claim 5,wherein the secondary content server includes a customer-premises mediaserver.
 7. The apparatus of claim 1, wherein the wireless signalincludes at least one of a Bluetooth signal, a wireless local areanetwork signal, or a cellular signal.
 8. A computer readable storagemedium comprising computer readable instructions that, when executed,cause a processor to at least: determine characteristics of frequenciesin a plurality of code bands of a frequency domain representation of anaudio signal that may contain a code, the code representative of atleast one of a first media or a broadcaster of the first media, thecode, if present, being encoded in the audio signal using a plurality offrequency components across the plurality of code bands; normalize thecharacteristics of the frequencies of respective ones of the code bands,the characteristic frequencies of a first one of the code bands beingnormalized against a threshold characteristic of a first frequency inthe first one of the code bands; compare sums of the normalizedcharacteristics for groups of frequencies across the plurality of codebands to identify a first group of frequencies with a largest sum;determine that the first group of frequencies is representative of thecode and decode the code from the first group of frequencies; andtransmit a wireless signal to a media presentation device, the wirelesssignal including the decoded code, the wireless signal to (1) cause themedia presentation device to obtain second media based on the decodedcode and (2) determine audience rating information corresponding topresentation of the first media and the second media on the mediapresentation device based on the decoded code.
 9. The computer readablestorage medium of claim 8, wherein the audience rating informationincludes a first reach and a second reach, the first reach correspondingto presentation of the first media and the second reach corresponding topresentation of the second media based on the decoded code.
 10. Thecomputer readable storage medium of claim 8, wherein the instructions,when executed, cause the processor to obtain a link to the second media,the link selectable by a viewer.
 11. The computer readable storagemedium of claim 10, wherein the audience rating informationcorresponding to presentation of the second media is determined inresponse to the viewer selecting the link to the second media.
 12. Thecomputer readable storage medium of claim 8, wherein the second media isobtained from a secondary content server.
 13. The computer readablestorage medium of claim 12, wherein the secondary content serverincludes a customer-premises media server.
 14. The computer readablestorage medium of claim 8, wherein the wireless signal includes at leastone of a Bluetooth signal, a wireless local area network signal, or acellular signal.
 15. A method comprising: determining characteristics offrequencies in a plurality of code bands of a frequency domainrepresentation of an audio signal that may contain a code, the coderepresentative of at least one of a first media or a broadcaster of thefirst media, the code, if present, being encoded in the audio signalusing a plurality of frequency components across the plurality of codebands; normalizing the characteristics of the frequencies of respectiveones of the code bands, the characteristic frequencies of a first one ofthe code bands being normalized against a threshold characteristic of afirst frequency in the first one of the code bands; comparing sums ofthe normalized characteristics for groups of frequencies across theplurality of code bands to identify a first group of frequencies with alargest sum; determining that the first group of frequencies isrepresentative of the code and decode the code from the first group offrequencies; and transmitting a wireless signal to a media presentationdevice, the wireless signal including the decoded code, the wirelesssignal to (1) cause the media presentation device to obtain second mediabased on the decoded code and (2) determine audience rating informationcorresponding to presentation of the first media and the second media onthe media presentation device based on the decoded code.
 16. The methodof claim 15, wherein the audience rating information includes a firstreach and a second reach, the first reach corresponding to presentationof the first media and the second reach corresponding to presentation ofthe second media based on the decoded code.
 17. The method of claim 16,wherein to obtain the second media, the media presentation device is toobtain a link to the second media, the link selectable by a viewer. 18.The method of claim 17, wherein the audience rating informationcorresponding to presentation of the second media is determined inresponse to the viewer selecting the link to the second media.
 19. Themethod of claim 15, wherein the second media is obtained from asecondary content server.
 20. The method of claim 19, wherein thesecondary content server includes a customer-premises media server.